#include <bits/stdc++.h>

using namespace std;

int main() {
  int n, sigma, mod; cin >> n >> sigma >> mod;
  vector<int> dp(n + 1);
  dp[1] = sigma;
  for (int i = 2; i <= n; ++i) {
    dp[i] = ((long long)dp[i - 1] * sigma + mod - dp[(i + 1) / 2]) % mod;
  }
  cout << dp[n] << endl;
  return 0;
}