#pragma region Macros #include using namespace std; using namespace __gnu_pbds; // using namespace __gnu_cxx; #define TO_STRING(var) # var #define pb emplace_back #define int ll #define endl '\n' using ll = long long; using ld = long double; const ld PI = acos(-1); const ld EPS = 1e-10; const int INF = 1 << 30; const ll INFL = 1LL << 62; // const int MOD = 998244353; const int MOD = 1000000007; int ceil(int x, int y) {return (x > 0 ? (x + y - 1) / y : x / y);} int POW(int x, int y) { if (y != (int)(y) or y < 0 or x != 0 && x != 1 && y > 64) {cout << "Error" << endl;return 0;} if (y == 0) return 1; if (y % 2 == 0) return POW(x * x, y / 2); return x * POW(x, y - 1); } __attribute__((constructor)) void constructor() { ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(15); } #pragma endregion struct Matrix{ long long p[2][2] = {{0, 0}, {0, 0}}; }; Matrix Multiplication(Matrix A, Matrix B){ Matrix C; for(int i = 0; i < 2; i++){ for(int j = 0; j < 2; j++){ for(int k = 0; k < 2; k++){ C.p[i][k] += A.p[i][j] * B.p[j][k]; C.p[i][k] %= 1000000000; } } } return C; } Matrix Power(Matrix A, long long n){ Matrix P = A, Q; bool flag = false; for(int i = 0; i < 60; i++){ if((n & (1LL << i)) != 0LL){ if(flag == false){ Q = P; flag = true; } else{ Q = Multiplication(Q, P); } } P = Multiplication(P, P); } return Q; } signed main(){ long long N, M; cin >> N >> M; Matrix A; A.p[0][0] = 1; A.p[0][1] = 1; A.p[1][0] = 1; Matrix B = Power(A, N - 2); cout << (B.p[1][0] + B.p[1][1]) % M << endl; }