#include<iostream>

 #include<cstring>

 #include<cstdio>

 using namespace std;

 typedef long long LL;

 LL _n, p;

 //快速加 -> x*n

 LL pow_add(LL x,LL n) {

     LL ret = , base = x;

     while (n) {

         if (n & ) {

             ret = (ret + base) % p;

         }

         base = (base + base) % p;

         n /= ;

     }

     return ret;

 }

 //快速幂 -> x^n

 LL pow_mod(LL x,LL n) {

     LL ret = , base = x;

     while (n) {

         if (n & ) {

             ret = pow_add(ret, base);

         }

         base = pow_add(base, base);

         n /= ;

     }

     return ret;

 }

 int main() {

     while (scanf("%lld%lld", &_n, &p) ==  && _n) {

         LL ans = pow_mod(,_n);

         ans = (ans + p - ) % p;

         printf("%lld\n", ans);

     }

     return ;

 }