Wael wrote on a single paper all different possible tuples (x,y,z) such that 1<=x,y,z<=N.Then ,he sorted them in the following order. First sort in increasing order according to their sum(x,y,z) . If two tuples have same sum ,then the tuple with smaller value of x is put first. Output the kth tuple from the sequence in format (x+2*y+3*z).
Input N= 2 K= 1
Input N= 2 K= 3
Input N= 50 K= 67
Can anyone explain me the approach?