/*
TASK:fib
LANG:C++
*/
#include <iostream>
using namespace std;
unsigned long long fib(unsigned long long a)
{
  if(a==1 || a==2)return 1;
  unsigned long long p=1,q=1,c,i=2;
  for(i=2;i<a;i++)
  {
    c=q+p;
    p=q;
    q=c;
  }
  return c;
}
int main()
{
  unsigned long long m,n;
  cin >>n >> m;
  cout << fib(n)%fib(m);
  return 0;
}
