hdu 3369 robot 差分求多项式的和

#include<stdio.h>
#include<string.h>
#define MODE 1000000007

long long f[12][12];
int k,kk,n,d;
int A[12]={1,1,2,6,24,120,720,5040,
40320,362880,3628800,39916800};
long long int inv[]={1,500000004,166666668,41666667,808333339,301388891,900198419,487524805,831947206,283194722,571199524};

int getDay(char *t)
{
    if(strcmp(t,"Monday")==0)
        return 1;
    if(strcmp(t,"Tuesday")==0)
        return 2;
    if(strcmp(t,"Wednesday")==0)
        return 3;
    if(strcmp(t,"Thursday")==0)
        return 4;
    if(strcmp(t,"Friday")==0)
        return 5;
    if(strcmp(t,"Saturday")==0)
        return 6;
    if(strcmp(t,"Sunday")==0)
        return 7;
}

int pows(long long a,int b,int p)
{
    long long res=1;