A - A Simple Math Problem

#include<cstdio>
#include<cstring>
using namespace std;
long long a[20],m,n,b[20];
void f()
{
    long long s1[14][14],s2[14][14],s3[14][14],sum=0;
    long long i,j,k;
    for (i=0;i<=9;i++)
    for (j=0;j<=9;j++)
    {
        if (j==9)
        {
            s1[i][9]=a[9-i];
            s2[i][9]=a[9-i];
        }
       else if (i==j+1)
        {
            s1[i][j]=1;
            s2[i][j]=1;
        }
        else
        {
            s1[i][j]=0;
            s2[i][j]=0;
        }
    }
    m-=10;
    while (m)
    {
        if (m&1)
        {
            memset(s3,0,sizeof(s3));
            for (i=0;i<=9;i++)
            for (j=0;j<=9;j++)
            for (k=0;k<=9;k++)
            s3[i][j]+=(s1[i][k]*s2[k][j])%n;
            for (i=0;i<=9;i++)
            for (j=0;j<=9;j++)
               s2[i][j]=s3[i][j];
        }
        memset(s3,0,sizeof(s3));
        for (i=0;i<=9;i++)
        for (j=0;j<=9;j++)
        for (k=0;k<=9;k++)
        s3[i][j]+=(s1[i][k]*s1[k][j])%n;
        for (i=0;i<=9;i++)
        for (j=0;j<=9;j++)
        s1[i][j]=s3[i][j];
        m>>=1;
    }
    for (i=0;i<=9;i++)  sum=((b[i]*s2[i][9])%n+sum)%n;
    printf("%lld\n",sum);
}
int main()
{
    long long i,j;
    while (~scanf("%lld%lld",&m,&n))
    {
        if (m==0&&n==0)  break;
        for (i=0;i<10;i++) scanf("%lld",&a[i]);
        for (i=0;i<10;i++) b[i]=i%n;
        if (m<10) printf("%lld\n",m%n);
        else f();

    }
    return 0;
}