Time Limit: 1000 mSec
Memory Limit: 32768 KB
A partition of a positive integer m into n parts is defined to construct a sequence a1,..,an such that a1+...+an=m, and a1<=a2<=...<=an.
It is apparent that such partition is not unique. We arrange them in lexicographic order. Your task is to find the k-th sequence.