#include<stdio.h>
const int N = 1e3+7;
int b;
char a[N];
int divMod()
{
	int s = 0;
	for(int i=0;a[i]!='\0';i++)
		s = (s*10+a[i]-'0')%b;
	return s;
}
int main()
{
    while(~scanf("%s %d",a,&b))
    {
    	int num = divMod();
    	printf("%d\n",num);
	}
	return 0;
 } 

#include<iostream>
#include<cstring>
using namespace std;

const int N=1007;

char a[N];
long long int ans,b;

int main(){
	while(cin>>a){
		ans=0;
		cin>>b;
		int n=strlen(a);
		for(int i=0;i<n;i++){
			long long int k=(a[n-i-1]-'0');
			long long int l=1;
			long long int j=i;
			while(j>0){
				if(k<100000)k*=10;
				else l*=10;
				if(l==100000){
					k*=(l%b);
					k%=b;
					l=1;
				}
				j--;
			}
			k=(k%b)*(l%b); 
			ans+=k;
			ans%=b;
		}
		printf("%lld\n",ans);
	}
	return 0;
}