**再好好想想

[Submit][Status][Web Board]

Description

FunnyAC likes mathematics very much. He thinks mathematics is very funny and beautiful.When he solved a math problem he would be very happy just like getting accepted in ACM.Recently, he find a very strange problem.Everyone know that the sum of sequence from 1 to n is n*(n + 1)/2. But now if we create a sequence which consists of the sum of sequence from 1 to n. The new sequence is 1, 1+ 2, 1+2+3, …. 1+2+…+n. Now the problem is that what is the sum of the sequence from1 to 1+2+…+n .Is it very simple? I think you can solve it. Good luck!

Input

The first line contain an integer T .Then T cases followed. Each case contain an integer n (1 <= n <= 10000000).

Output

For each case,output the sum of first n items in the new sequence. Because the sum is very larger, so output sum % 20090524.

Sample Input

3
1
24
56

Sample Output

1
2600
30856

#include <stdio.h>
int main()
{
    long long n,m,t,s;
    scanf("%I64d",&m);
    while(m--)
    {
        scanf("%I64d",&n);
       s=((n*(n+1))%120543144*(n+2)%120543144)%120543144/6;
        printf("%I64d\n",s);
    }
    return 0;
}