Sum of Series

Given a function f(x) = anxn + an-1xn-1 + .... + a1x1 + a0, find SUMx=0x=m f(x) mod 1009 (a prime number) for given n and m. Input First line contains two space separated integers n and m. Next line contains n+1 space separated integers (each non negative and less than 100) which are the co-efficients an, an-1, ... , a0. 0 Output Output a single integer which is the sum mod 1009. Example In