#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
int main(){
  int N, P;
  cin >> N >> P;
  vector<int> f;
  for (int i = 1; i <= N; i++){
    if (P % i == 0){
      f.push_back(i);
    }
  }
  vector<long long> inv(N + 1);
  inv[1] = 1;
  for (int i = 2; i <= N; i++){
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
  }
  vector<long long> fact(N + 1);
  vector<long long> finv(N + 1);
  fact[0] = 1;
  finv[0] = 1;
  for (int i = 1; i <= N; i++){
    fact[i] = fact[i - 1] * i % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
  vector<long long> dp(N + 1, 0);
  dp[0] = 1;
  for (int i = 0; i < N; i++){
    for (int j : f){
      if (i + j <= N){
        dp[i + j] += dp[i] * fact[N - i - 1] % MOD * finv[N - i - j] % MOD;
        dp[i + j] %= MOD;
      }
    }
  }
  cout << (fact[N] - dp[N] + MOD) % MOD << endl;
}