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;
int P;
int ad(int k1, int k2) { return k1 += k2 - P, k1 += k1 >> 31 & P; }
int su(int k1, int k2) { return k1 -= k2, k1 += k1 >> 31 & P; }
int mu(int k1, int k2) { return 1LL * k1 * k2 % P; }
void uad(int& k1, int k2) { k1 += k2 - P, k1 += k1 >> 31 & P; }
void usu(int& k1, int k2) { k1 -= k2, k1 += k1 >> 31 & P; }
template <class... T>
int ad(int k1, T... k2) {
  return ad(k1, ad(k2...));
}
template <class... T>
int su(int k1, T... k2) {
  return su(k1, ad(k2...));
}
template <class... T>
int mu(int k1, T... k2) {
  return mu(k1, mu(k2...));
}
template <class... T>
void uad(int& k1, T... k2) {
  return uad(k1, ad(k2...));
}
template <class... T>
void usu(int& k1, T... k2) {
  return usu(k1, ad(k2...));
}
int po(int k1, int k2) {
  int k3 = 1;
  for (; k2; k2 >>= 1, k1 = mu(k1, k1))
    if (k2 & 1) k3 = mu(k3, k1);
  return k3;
}
const int N = 205;
int n, fac[N], inv[N], ifac[N];
int main() {
  scanf("%d%d", &n, &P);
  fac[0] = fac[1] = inv[0] = inv[1] = ifac[0] = ifac[1] = 1;
  for (int i = (2); i <= (N - 1); ++i)
    fac[i] = mu(fac[i - 1], i), inv[i] = mu(P - P / i, inv[P % i]),
    ifac[i] = mu(ifac[i - 1], inv[i]);
  int res = 0;
  for (int mn = (n + 1); mn >= (1); --mn) {
    vector<vector<int> > dp(mn + 1, vector<int>(mn + 1, 0));
    for (int tot = (1); tot <= (mn); ++tot) {
      dp[tot][mn * tot - mn * tot] = ifac[tot];
    }
    for (int i = (mn); i <= (n); ++i) {
      vector<vector<int> > ndp(i + 2, vector<int>(mn + 1, 0));
      for (int tot = (1); tot <= (i); ++tot) {
        for (int sum = (mn * tot); sum <= (mn * min(tot + 1, i)); ++sum)
          if (dp[tot][sum - mn * tot]) {
            for (int delta = 0;
                 delta <= i + 1 - tot &&
                 delta <= (mn * (i + 1) - sum) / (i + 1) &&
                 sum + delta * (i + 1) <= mn * min(tot + delta + 1, i + 1);
                 ++delta) {
              uad(ndp[tot + delta][sum + delta * (i + 1) - mn * (tot + delta)],
                  mu(dp[tot][sum - mn * tot], ifac[delta]));
            }
          }
      }
      dp = ndp;
    }
    int old = res;
    for (int i = (0); i <= (((int)(dp[n]).size()) - 1); ++i) {
      uad(res, dp[n][i]);
    }
    ((void)0);
    if (res == old) break;
  }
  printf("%d\n", mu(fac[n], res));
  return 0;
}
