#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string &s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long x, long long y) { return x / gcd(x, y) * y; }
long long INF = 1e18 + 13;
long double eps = 1e-12;
long double PI = 3.14159265;
const long long MAXN = 4 * 1e6 + 13;
const long long MAXH = 100;
const long long MAXM = 1e5 + 13;
long long MOD;
long long dp[MAXN];
long long pref[2 * MAXN + 2];
void solve() {
  long long n;
  cin >> n >> MOD;
  dp[n] = 1;
  pref[n] = 1;
  long long summ = 1;
  for (long long i = n - 1; i >= 1; i--) {
    dp[i] += summ;
    dp[i] = dp[i] % MOD;
    for (long long j = 2; j * i <= n; j++) {
      dp[i] += (pref[i * j] - pref[i * j + j]);
      dp[i] = dp[i] % MOD;
    }
    summ += dp[i];
    summ = summ % MOD;
    pref[i] = pref[i + 1] + dp[i];
    pref[i] = pref[i] % MOD;
  }
  cout << dp[1];
}
int32_t main() {
  long long t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
