CMPLS  Complete the Sequence!
You probably know those quizzes in Sunday magazines: given the sequence 1, 2, 3, 4, 5, what is the next number? Sometimes it is very easy to answer, sometimes it could be pretty hard. Because these "sequence problems" are very popular, ACM wants to implement them into the "Free Time" section of their new WAP portal.
ACM programmers have noticed that some of the quizzes can be solved by describing the sequence by polynomials. For example, the sequence 1, 2, 3, 4, 5 can be easily understood as a trivial polynomial. The next number is 6. But even more complex sequences, like 1, 2, 4, 7, 11, can be described by a polynomial. In this case, 1/2.n^{2}1/2.n+1 can be used. Note that even if the members of the sequence are integers, polynomial coefficients may be any real numbers.
Polynomial is an expression in the following form:
If a_{D} <> 0, the number D is called a degree of the polynomial. Note that constant function P(n) = C can be considered as polynomial of degree 0, and the zero function P(n) = 0 is usually defined to have degree 1.
Input
There is a single positive integer T on the first line of input (equal to about 5000). It stands for the number of test cases to follow. Each test case consists of two lines. First line of each test case contains two integer numbers S and C separated by a single space, 1 <= S < 100, 1 <= C < 100, (S+C) <= 100. The first number, S, stands for the length of the given sequence, the second number, C is the amount of numbers you are to find to complete the sequence.
The second line of each test case contains S integer numbers X_{1}, X_{2}, ... X_{S} separated by a space. These numbers form the given sequence. The sequence can always be described by a polynomial P(n) such that for every i, X_{i} = P(i). Among these polynomials, we can find the polynomial P_{min} with the lowest possible degree. This polynomial should be used for completing the sequence.
Output
For every test case, your program must print a single line containing C integer numbers, separated by a space. These numbers are the values completing the sequence according to the polynomial of the lowest possible degree. In other words, you are to print values P_{min}(S+1), P_{min}(S+2), .... P_{min}(S+C).
It is guaranteed that the results P_{min}(S+i) will be nonnegative and will fit into the standard integer type.
Example
Sample Input:
4 6 3 1 2 3 4 5 6 8 2 1 2 4 7 11 16 22 29 10 2 1 1 1 1 1 1 1 1 1 2 1 10 3
Sample Output:
7 8 9 37 46 11 56 3 3 3 3 3 3 3 3 3 3Warning: large Input/Output data, be careful with certain languages
hide comments
kushagramadan:
20151212 16:11:38
Why is Lagrange's interpolation giving a wrong answer? 

arulxze:
20151013 07:10:27
The sequence 1 1 1 1 1 1 1 1 1 2 11 56 doesn't make any sense to me 

nguyễn vãn lâm:
20150929 16:52:11
the important is find polynomial in the seq Last edit: 20150929 16:52:53 

lukedan:
20150919 14:21:59
Why can't I compile my program :( 

vinodkgupta:
20150908 15:21:25
please can any one tell me how do i convert the seq no in polynomial? 

gaurav56singh:
20150823 14:07:46
can anyone tell me why i am getting runtime error in this problem while y code generating correct output for the first test case my submission id is 14960874.please help 

Saurav Sagar:
20150821 14:22:08
Can anyone explain me the third input. 

enigmus:
20150810 23:37:08
I would recommend everyone to use polynomial finite difference theorem. I got AC in 0.48s using Python 

Sudharsansai:
20150803 17:17:11
Need not use Lagrange's Interpolation :) 

Anand:
20150628 20:09:10
It is lagrange's interpolation problem.

Added by:  adrian 
Date:  20040508 
Time limit:  5s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS PERL6 VB.NET 
Resource:  ACM Central European Programming Contest, Prague 2000 