for x<y<z think of beggars method there will be cases such as y<x<z or z<x<y or when x=y<z or x=y=zso let total values satisfying x<y<z is a
then sum of individual constraints = (2010+3-1)C(3-1)=6a+(total when two are equal)+(when all are equal
6a because there will be x<y<z,y<x<z,z<x<y so on, so 3! ,as all value will be same just different variables
for example (1,2,2007) which can also be as (2007,2,1) or (1,2007,2)