#include<stdio.h>
#include<string.h>
#define N 1000
int n,p,unu[100],doi[100],trei[100],sol;
void creare(char s[N],int v[N])
{
	int n,i,k=0;
	n=strlen(s);
	k=0;
	v[k++]=n;
	for(i=0;i<n;i++)
		v[k++]=s[i]-'0';
}
void afis(int v[N])
{
	int i;
	if(v[v[0]]==0)
		printf("%d",0);
	else
		for(i=v[0];i>=1;i--)
			printf("%d",v[i]);
	printf("\n");
}
void suma(int v1[N],int v2[N],int sum[N])
{
	int i,t=0,k=1;
	for(i=1;i<=v1[0]&&i<=v2[0];i++)
	{
		sum[k++]=(v1[i]+v2[i]+t)%10;
		t=(v1[i]+v2[i]+t)/10;
	}
	while(i<=v1[0])
	{
		sum[k++]=(v1[i]+t)%10;
		t=(v1[i]+t)/10;
		i++;
	}
	while(i<=v2[0])
	{
		sum[k++]=(v2[i]+t)%10;
		t=(v2[i]+t)/10;
		i++;
	}
	if(t)
		sum[k++]=t;
	sum[0]=k-1;
}
void scad(int v1[N],int v2[N],int dif[N])
{
	int i,k=1,j;
	//inters(v1,v2);
	for(i=1;i<=v1[0]&&i<=v2[0];i++)
		if(v1[i]-v2[i]>=0)
		{
			dif[k++]=v1[i]-v2[i];
			if(v1[i]-v2[i]==0&&i==v1[0])
			{
			//	v1[0]--;
				//k--;
			}
		}
		else
		{
			dif[k++]=v1[i]+10-v2[i];
			for(j=i+1;v1[j]==0&&j<=v1[0];j++)
				v1[j]=9;
			v1[j]--;
			if(v1[j]==0&&j==v1[0])
				v1[0]--;
		}
	while(i<=v1[0])
	{
		dif[k++]=v1[i];
		i++;
	}
	dif[0]=k-1;
}
void mul1(int A[N], int B)  
{  
    int i, t = 0;  
    for (i = 1; i <= A[0] || t; i++, t /= 10)  
            A[i] = (t += A[i] * B) % 10;  
    A[0] = i - 1;  
}
void mul2(int A[N], int B[N])  
{  
    int i, j, t, C[N];  
    memset(C, 0, sizeof(C));  
    for (i = 1; i <= A[0]; i++)  
    {  
        for (t=0, j=1; j <= B[0] || t; j++, t/=10)  
			C[i+j-1]=(t+=C[i+j-1]+A[i]*B[j])%10;  
        if (i + j - 2 > C[0]) C[0] = i + j - 2;  
    }  
    memcpy(A, C, sizeof(C));  
}
void imp(int A[N],int B[N],int nr[N])
{
	int sum[N],C[N];
	nr[0]=1;
	nr[1]=0;
	while(A[0]!=1||A[1]!=0)
	{
		scad(A,B,C);
		memcpy(A,C,sizeof(C));
		suma(nr,unu,sum);
		memcpy(nr,sum,sizeof(sum));
	}
}
void div(int A[N], int B)  
{  
    int i, t = 0;  
    for (i = A[0]; i > 0; i--, t %= B)  
            A[i] = (t = t * 10 + A[i]) / B;  
    for (; A[0] > 1 && !A[A[0]]; A[0]--);  
}
int mod(int A[], int B)  
{  
    int i, t = 0;  
    for (i = A[0]; i > 0; i--)  
            t = (t * 10 + A[i]) % B;  
    return t;  
}
void inv(char s[N])
{
	int i,j;
	char aux;
	for(i=0,j=strlen(s)-1;i<j;i++,j--)
	{
		aux=s[i];
		s[i]=s[j];
		s[j]=aux;
	}
}
void read_solve()
{
	char s1[N],s2[N],s3[3]="1",s4[3]="2",s5[3]="3";
	int v1[N],v2[N],sum[N],dif[N],v11[N],nr[N];
	scanf("%s%d",&s1,&p);
	inv(s1);
	creare(s1,v1);
	creare(s3,unu);
	creare(s5,trei);
	memcpy(v11,v1,sizeof(v1));
	scad(v1,unu,dif);
	memcpy(v1,v11,sizeof(v11));
	suma(v11,unu,sum);
	mul2(dif,sum);
	mul2(v1,dif);
	//imp(v1,trei,nr);
	div(v1,3);
	sol=mod(v1,p);
	//afis(v1);
	printf("%d\n",sol);
}
int main()
{
	freopen("suma.in","r",stdin);
	freopen("suma.out","w",stdout);
	/*scanf("%d%d",&n,&p);
	printf("%d\n",((n-1)*n*(n+1)/3)%p);*/
	read_solve();
	return 0;
}