#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL << 60;
const long long int Mod = 1000000007;
const long long int sMod = 998244353;
using ll = long long int;
using ci = const int;
using vi = vector<int>;
using Vi = vector<long long int>;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
template <class T>
bool chmax(T &former, const T &b) {
  if (former < b) {
    former = b;
    return true;
  }
  return false;
}
template <class T>
bool chmin(T &former, const T &b) {
  if (b < former) {
    former = b;
    return true;
  }
  return false;
}
template <class T>
T sqar(T x) {
  return x * x;
}
template <class T>
inline void princ(T x) {
  cout << x << " ";
};
template <class T>
inline void print(T x) {
  cout << x << "\n";
};
template <class T>
inline void Yes(T condition) {
  if (condition)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}
template <class T>
inline void YES(T condition) {
  if (condition)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
Vi dp(4000050, 0);
void solve() {
  int n, m;
  cin >> n >> m;
  int sum = 0;
  dp[1] = 1;
  for (ll j = ll(3); j < ll(n + 1); ++j) {
    dp[j] = 1;
  }
  for (ll i = ll(2); i < ll(n + 1); ++i) {
    dp[i] += dp[i - 1];
    dp[i] %= m;
    dp[i] += dp[i - 1];
    dp[i] %= m;
    for (ll j = i + i; j <= n; j += i) {
      dp[j] += dp[i] - dp[i - 1];
      while (dp[j] < 0) dp[j] += m;
      dp[j] %= m;
    }
  }
  print(dp[n]);
  return;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  std::cout << std::fixed << std::setprecision(30);
  solve();
  return 0;
}
