Please use C

Pancakes One day, Bibi encounters The Lazy Caterers Problem. The core of the problem is to find the maximum number pieces of pancake that can be made by slicing the pancake with X cuts. Bibi is wondering what are the sequences of The Lazy Caterers Problem ranging from 0 cut(s) to N 1 cut(s). Format Input The first line of the input contains an integer T , the number of test cases. Each test case contains an integer N , indicating the upper range of The Lazy Caterers Problem sequence. Format Output Print N number which is the sequence from 0 cut(s) until N 1 cut(s). Dont forget to print the prefix Case T: . Constraints 1 T 100 1 N 10, 000 Sample Input (standard input) 3 1 10 15 Sample Output (standard output) Case 1: 1 Case 2: 1 2 4 7 11 16 22 29 37 46 Case 3: 1 2 4 7 11 16 22 29 37 46 56 67 79 92 106 Note Do not print trailing spaces.

Constraints In test case 2, When 0 cuts are made the pancake turns into 1 slice(s). When 1 cut are made the pancake turns into 2 slice(s). When 2 cuts are made the pancake turns into 4 slice(s). . . . When 9 cuts are made the pancake turns into 46 slice(s).