#include <iostream> #include <algorithm> using namespace std; typedef unsigned long long ull; typedef __int128 i128; ull mul(ull a, ull b, ull mod) { return (i128)a * b % mod; } ull fib(ull n, ull mod) { if (mod == 1) return 0; ull a = 1, b = 1; for (ull i = 63; i--;) { ull c = mul(a, (2*b - a + mod) % mod, mod); ull d = (mul(a,a,mod) + mul(b,b,mod)) % mod; a = c, b = d; if (n >> i & 1) { ull t = b; b = (a + b) % mod; a = t; } } return a; } int main() { ull n, m, p; cin >> n >> m >> p; ull fm = fib(m, 1ULL << 63); ull fn2 = fib(n + 2, fm); ull ans = (fn2 - 1 + fm) % fm; ans %= p; cout << ans << endl; return 0; }