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;
const int INF = 1 << 30;
const long long int MAX = 1e9 + 7;
void array_show(int* array, int array_n, char middle = ' ') {
  for (int i = 0; i < array_n; i++)
    printf("%d%c", array[i], (i != array_n - 1 ? middle : '\n'));
}
void array_show(long long int* array, int array_n, char middle = ' ') {
  for (int i = 0; i < array_n; i++)
    printf("%lld%c", array[i], (i != array_n - 1 ? middle : '\n'));
}
void array_show(vector<int>& vec_s, int vec_n = -1, char middle = ' ') {
  if (vec_n == -1) vec_n = vec_s.size();
  for (int i = 0; i < vec_n; i++)
    printf("%d%c", vec_s[i], (i != vec_n - 1 ? middle : '\n'));
}
void array_show(vector<long long int>& vec_s, int vec_n = -1,
                char middle = ' ') {
  if (vec_n == -1) vec_n = vec_s.size();
  for (int i = 0; i < vec_n; i++)
    printf("%lld%c", vec_s[i], (i != vec_n - 1 ? middle : '\n'));
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v1) {
  int n = v1.size();
  for (int i = 0; i < n; i++) {
    if (i) os << " ";
    os << v1[i];
  }
  return os;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
  os << p.first << " " << p.second;
  return os;
}
template <typename T>
istream& operator>>(istream& is, vector<T>& v1) {
  int n = v1.size();
  for (int i = 0; i < n; i++) is >> v1[i];
  return is;
}
template <typename T1, typename T2>
istream& operator>>(istream& is, pair<T1, T2>& p) {
  is >> p.first >> p.second;
  return is;
}
template <typename T>
T ext_gcd(T a, T b, T& x, T& y) {
  if (a < b) return ext_gcd(b, a, y, x);
  if (b == 0) {
    x = 1, y = 0;
    return a;
  }
  T gcd_val = ext_gcd(b, a % b, x, y);
  swap(x, y);
  y -= x * (a / b);
  if (x > b) y += (x / b) * a, x %= b;
  if (y > a) x += (y / a) * b, y %= a;
  return gcd_val;
}
long long int mod = 1e9 + 7;
class modint {
 private:
  long long int val;
  long long int gcd(long long int a, long long int b) {
    if (a < b) swap(a, b);
    if (b == 0) return a;
    return gcd(b, a % b);
  }

 public:
  bool prime = false;
  modint() : val(0) {}
  template <class T>
  modint(T a) {
    val = (long long int)a % mod;
    if (val < 0) val += mod;
  }
  long long int value() const { return val; }
  long long int get_mod() const { return mod; }
  modint& operator++() {
    val++;
    if (val == mod) val = 0;
    return *this;
  }
  modint operator++(int) {
    modint ans = *this;
    ++*this;
    return ans;
  }
  modint& operator--() {
    if (val == 0) val = mod;
    val--;
    return *this;
  }
  modint operator--(int) {
    modint ans = *this;
    --*this;
    return ans;
  }
  modint& operator+=(const modint& a) {
    val += a.value();
    if (val >= mod) val -= mod;
    return *this;
  }
  modint& operator-=(const modint& a) {
    val -= a.value();
    if (val < 0) val += mod;
    return *this;
  }
  modint& operator*=(const modint& a) {
    val *= a.value();
    if (val >= mod) val %= mod;
    return *this;
  }
  modint pow(long long int index) const {
    assert(index >= 0);
    if (prime && index >= mod - 1) index %= mod - 1;
    modint a = *this, ans = 1;
    for (long long int i = 1; i >= 0 && i <= index; i <<= 1) {
      if (index & i) ans *= a;
      a *= a;
    }
    return ans;
  }
  modint inverse() const {
    if (prime) {
      assert(val != 0);
      return pow(mod - 2);
    }
    long long int x, y;
    long long int g = ext_gcd<long long int>(val, mod, x, y);
    assert(g == 1);
    return x;
  }
  modint& operator/=(const modint& a) {
    if (prime) {
      *this = (*this) * a.inverse();
      return *this;
    }
    long long int g = gcd(val, a.value());
    modint a2 = a.value() / g;
    val /= g;
    *this = (*this) * a2.inverse();
    return *this;
  }
  friend modint operator-(const modint& a, const modint& b) {
    return (modint)a -= b;
  }
  friend modint operator+(const modint& a, const modint& b) {
    return (modint)a += b;
  }
  friend modint operator*(const modint& a, const modint& b) {
    return (modint)a *= b;
  }
  friend modint operator/(const modint& a, const modint& b) {
    return (modint)a /= b;
  }
  friend bool operator==(const modint& a, const modint& b) {
    return a.value() == b.value();
  }
  friend bool operator!=(const modint& a, const modint& b) {
    return a.value() != b.value();
  }
  friend modint pow(const modint& a, const long long int b) { return a.pow(b); }
  modint operator+() const { return *this; }
  modint operator-() const { return modint() - *this; }
  friend ostream& operator<<(ostream& os, const modint& a) {
    os << a.value();
    return os;
  }
  friend istream& operator>>(istream& is, modint& a) {
    long long int val;
    is >> val;
    a = val;
    return is;
  }
};
namespace sol {
const int N = 222;
modint kai[N];
modint comb[N][N];
void solve() {
  int n, mi;
  int i, j, k;
  int a, b, c;
  int x, y;
  cin >> n >> mod;
  modint s = 2;
  kai[0] = 1;
  for (i = 1; i < N; i++) {
    kai[i] = kai[i - 1] * i;
  }
  for (i = 1; i < N; i++) {
    for (j = 0; j <= i; j++) {
      comb[i][j] = kai[i] / (kai[j] * kai[i - j]);
    }
  }
  for (mi = n; mi >= 1; mi--) {
    vector<int> v1(n), v2(n + 1);
    v2[0] = 0;
    for (j = 0; j < n; j++) {
      v1[j] = max(n + 1 - j, mi);
      if (j && v1[j] == mi + 1) v1[j] = mi;
      v2[j + 1] = v2[j] + v1[j];
    }
    if (v1[0] * mi < v2[n]) break;
    x = v1[0] * mi - v2[n], y = v1[0] - v1.back();
    vector<vector<vector<modint> > > dp(
        n + 1, vector<vector<modint> >(x + 1, vector<modint>(y + 2)));
    dp[0][x][y + 1] = 1;
    for (i = 0; i < n; i++) {
      for (j = 0; j <= x; j++) {
        for (k = 0; k <= y + 1; k++) {
          if (dp[i][j][k] == 0) continue;
          for (a = v1[i] - mi; a < k; a++) {
            for (b = i + 1; b <= n; b++) {
              c = v2[b] - v2[i];
              c = (a + mi) * (b - i) - c;
              if (j < c) break;
              dp[b][j - c][a] += dp[i][j][k] * comb[b][i];
            }
          }
        }
      }
    }
    for (i = 0; i <= x; i++) {
      s += dp[n][i][0];
    }
  }
  cout << s << endl;
}
}  // namespace sol
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  sol::solve();
}
