#include <bits/stdc++.h>
using namespace std;  
const long long MOD = 998244353;
const int LOG = 60;
int main(){
  long long N, M;
  cin >> N >> M;
  assert(N <= 100);
  vector<long long> POW(LOG);
  for (int i = 0; i < LOG; i++){
    POW[i] = (long long) 1 << i;
  }
  vector<vector<long long>> S(LOG, vector<long long>(2, 0));
  for (int i = 0; i < LOG; i++){
    long long b = POW[i];
    S[i][0] = M / (b * 2) * b + min(M % (b * 2), b);
    S[i][1] =  M / (b * 2) * b + max(M % (b * 2) - b, (long long) 0);
    S[i][0] %= MOD;
    S[i][1] %= MOD;
  }
  vector<vector<vector<long long>>> dp(N - 1, vector<vector<long long>>(LOG, vector<long long>(2, 0)));
  for (int i = 0; i < LOG; i++){
    for (int j = 0; j < 2; j++){
      dp[0][i][j] = S[i][j] * (POW[i] % MOD) % MOD;
    }
  }
  for (int i = 1; i < N - 1; i++){
    for (int j = 0; j < LOG; j++){
      for (int k = 0; k < 2; k++){
        for (int l = 0; l < LOG; l++){
          for (int m = 0; m < 2; m++){
            vector<vector<long long>> dp2(LOG + 1, vector<long long>(2, 0));
            dp2[LOG][0] = 1;
            for (int x = LOG - 1; x >= 0; x--){
              for (int y = 0; y < 2; y++){
                for (int d = 0; d < 2; d++){
                  if (!(x == j && d == k) && !(x == l && d != m)){
                    if (!((M >> x & 1) == 0 && y == 0 && d == 1)){
                      int y2 = y;
                      if ((M >> x & 1) == 1 && d == 0){
                        y2 = 1;
                      }
                      dp2[x][y2] += dp2[x + 1][y];
                    }
                  }
                }
              }
            }
            long long cnt = dp2[0][1] % MOD;
            dp[i][l][m] += dp[i - 1][j][k] * cnt % MOD * (POW[l] % MOD);
            dp[i][l][m] %= MOD;
          }
        }
      }
    }
  }
  long long ans = 0;
  for (int i = 0; i < LOG; i++){
    for (int j = 0; j < 2; j++){
      ans += dp[N - 2][i][j] * S[i][j ^ 1];
      ans %= MOD;
    }
  }
  cout << ans << endl;
}