the macdonald polynomials have long been a source of interesting combinatorial questions. in a recent paper, haglund, haiman and loeher managed to give an entirely combinatorial description of them. they showed that their description defines polynomials indexed not just by partitions, but indeed by any diagram of cells in the positive integer lattice. however, the combinatorial coefficients they describe are somewhat unwieldly. i will show how these coefficients can be expressed as certain $q,t$ analogs of multinomial coefficients, and give a recursive construction for rectangular shapes.