A sequence of integers b_1, b_2, …, b_m is called good if max(b_1, b_2, …, b_m) ⋅ min(b_1, b_2, …, b_m) ≥ b_1 + b_2 + … + b_m.

A sequence of integers a_1, a_2, …, a_n is called perfect if every non-empty subsequence of a is good.

YouKn0wWho has two integers n and M, M is prime. Help him find the number, modulo M, of perfect sequences a_1, a_2, …, a_n such that 1 ≤ a_i ≤ n + 1 for each integer i from 1 to n.

A sequence d is a subsequence of a sequence c if d can be obtained from c by deletion of several (possibly, zero or all) elements.

Input

The first and only line of the input contains two space-separated integers n and M (1 ≤ n ≤ 200; 10^8 ≤ M ≤ 10^9). It is guaranteed that M is prime.

Output

Print a single integer — the number of perfect sequences modulo M.

Examples

Input


2 998244353


Output


4


Input


4 100000007


Output


32


Input


69 999999937


Output


456886663

Note

In the first test case, the perfect sequences are [2, 2], [2, 3], [3, 2] and [3, 3].

In the second test case, some of the perfect sequences are [3, 4, 3, 5], [4, 5, 4, 4], [4, 5, 5, 5] etc. One example of a sequence which is not perfect is [2, 3, 3, 4], because, for example, the subsequence [2, 3, 4] is not an good as 2 ⋅ 4 < 2 + 3 + 4.
10 999999937
 4 998244353
 198 549999959
 22 100757149
 2 549999959
 103 267850993
 1 550000001
 192 999999937
 6 998244353
 194 100000007
 162 999999937
 3 549999959
 140 550000001
 106 100757149
 120 267850993
 170 100000007
 93 267850993
 196 100000007
 191 100757149
 20 549999959
 9 999999937
 1 100000007
 130 100757149
 197 100000007
 192 998244353
 160 100757149
 193 998244353
 110 999999937
 190 999999937
 10 267850993
 7 100000007
 100 267850993
 82 267850993
 8 549999959
 200 550000001
 200 998244353
 169 100757149
 195 549999959
 119 999999937
 50 100757149
 196 100757149
 180 100757149
 5 100757149
 28 549999959
 150 998244353
 200 549999959
 188 100757149
 190 267850993
 199 550000001

38324
 32
 545511297
 12864320
 4
 262873012
 2
 960726876
 295
 24964109
 356680016
 11
 464259310
 7881104
 91785690
 28293730
 34145854
 80552289
 22329873
 461862358
 10901
 2
 87253785
 59296946
 216873641
 54532638
 959300190
 165234842
 259139303
 38324
 940
 189712610
 181769218
 3148
 481731577
 180611733
 41487196
 305462979
 810859890
 4745300
 71649802
 40944895
 97
 265377742
 563043130
 178617235
 15934891
 38309988
 262511266

#include <bits/stdc++.h>
using namespace std;
long long mod = 999999937;
const long long INF = mod * mod;
const long double eps = 1e-8;
const long double pi = acosl(-1.0);
long long mod_pow(long long x, long long n, long long m = mod) {
  if (n < 0) {
    long long res = mod_pow(x, -n, m);
    return mod_pow(res, m - 2, m);
  }
  if (abs(x) >= m) x %= m;
  if (x < 0) x += m;
  long long res = 1;
  while (n) {
    if (n & 1) res = res * x % m;
    x = x * x % m;
    n >>= 1;
  }
  return res;
}
struct modint {
  long long n;
  modint() : n(0) { ; }
  modint(long long m) : n(m) {
    if (n >= mod)
      n %= mod;
    else if (n < 0)
      n = (n % mod + mod) % mod;
  }
  operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) {
  a.n += b.n;
  if (a.n >= mod) a.n -= mod;
  return a;
}
modint operator-=(modint& a, modint b) {
  a.n -= b.n;
  if (a.n < 0) a.n += mod;
  return a;
}
modint operator*=(modint& a, modint b) {
  a.n = ((long long)a.n * b.n) % mod;
  return a;
}
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, long long n) {
  if (n == 0) return modint(1);
  modint res = (a * a) ^ (n / 2);
  if (n % 2) res = res * a;
  return res;
}
long long inv(long long a, long long p) {
  return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) {
  a = a / b;
  return a;
}
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
  fact[0] = modint(1);
  for (int i = 0; i < max_n - 1; i++) {
    fact[i + 1] = fact[i] * modint(i + 1);
  }
  factinv[max_n - 1] = modint(1) / fact[max_n - 1];
  for (int i = max_n - 2; i >= 0; i--) {
    factinv[i] = factinv[i + 1] * modint(i + 1);
  }
}
modint comb(int a, int b) {
  if (a < 0 || b < 0 || a < b) return 0;
  return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
  if (a < 0 || b < 0 || a < b) return 0;
  return fact[a] * factinv[a - b];
}
void expr(int n) {
  int ans = 0;
  vector<int> cur;
  function<void(int)> dfs = [&](int dep) {
    if (dep == n) {
      bool valid = true;
      for (int i = 0; i < cur.size(); i++) {
        int sum = 0;
        int mi = cur[i];
        int ma = cur[i];
        for (int j = i; j < cur.size(); j++) {
          sum += cur[j];
          mi = min(mi, cur[j]);
          ma = max(ma, cur[j]);
          if (mi * ma < sum) {
            valid = false;
          }
        }
      }
      if (valid) {
        ans++;
        for (int i = 0; i < cur.size(); i++) {
          cout << cur[i] << " ";
        }
        cout << "\n";
      }
      return;
    }
    for (int i = 2; i <= n + 1; i++) {
      cur.push_back(i);
      dfs(dep + 1);
      cur.pop_back();
    }
  };
  dfs(0);
  cout << ans << "\n";
}
void expr2(int n) {
  int ans = 0;
  vector<int> cur;
  function<void(int)> dfs = [&](int dep) {
    if (dep == n) {
      bool valid = true;
      int mi = cur[0];
      int ma = cur[0];
      int sum = 0;
      bool valid2 = true;
      for (int i = 0; i < cur.size(); i++) {
        int sum = 0;
        int mi = cur[i];
        int ma = cur[i];
        for (int j = i; j < cur.size(); j++) {
          sum += cur[j];
          mi = min(mi, cur[j]);
          ma = max(ma, cur[j]);
          if (mi * ma < sum) {
            valid2 = false;
          }
        }
      }
      for (int i = 0; i < cur.size(); i++) {
        mi = min(mi, cur[i]);
        ma = max(ma, cur[i]);
        sum += cur[i];
      }
      if (mi * ma < sum) {
        valid = false;
      }
      if (valid && !valid2) {
        ans++;
        for (int i = 0; i < cur.size(); i++) {
          cout << cur[i] << " ";
        }
        cout << "\n";
      }
      return;
    }
    for (int i = 2; i <= n + 1; i++) {
      cur.push_back(i);
      dfs(dep + 1);
      cur.pop_back();
    }
  };
  dfs(0);
  cout << ans << "\n";
}
modint dp[205][205];
modint pas[205][205];
void solve() {
  int n;
  cin >> n;
  int m;
  cin >> m;
  mod = m;
  for (int i = 0; i < 205; i++)
    for (int j = 0; j < 205; j++) {
      if (i == 0 || j == 0)
        pas[i][j] = 1;
      else
        pas[i][j] = pas[i - 1][j] + pas[i][j - 1];
    }
  modint ans = 0;
  ans += mod_pow(2, n);
  for (int mi = 1; mi < n; mi++) {
    int x = 0;
    for (int len = mi + 1; len <= n; len++) {
      x += (len + 1) - mi;
    }
    if (x > mi) continue;
    for (int j = 0; j < n + 1; j++)
      for (int k = 0; k < mi + 1; k++) dp[j][k] = 0;
    for (int cnt = 1; cnt <= mi; cnt++) {
      dp[cnt][0] = 1;
    }
    for (int val = mi + 1; val <= n + 1; val++) {
      for (int j = val - 1; j >= 0; j--) {
        for (int k = mi + 1 - 1; k >= 0; k--) {
          if (dp[j][k] == (modint)0) continue;
          for (int ad = 1; j + ad < val; ad++) {
            int nj = j + ad;
            int nk = k + (val - mi) * ad;
            if (nk > mi) break;
            dp[nj][nk] += dp[j][k] * pas[ad][j];
          }
        }
      }
    }
    for (int k = 0; k < mi + 1; k++) ans += dp[n][k];
  }
  cout << ans << "\n";
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  solve();
  return 0;
}
