/*
TASK:fib
LANG:C++
*/
#include<iostream>
using namespace std;
unsigned long long n,m,a[1000000],i;
int main()
{
cin>>n>>m;
int k=n;
if(k<m)k=m;
a[1]=1; a[2]=1;
for(i=3;i<=k;i++)
 a[i]=a[i-1]+a[i-2];
cout<<a[n]%a[m]<<endl;
return 0;
}
