#include<bits/stdc++.h>

using namespace std;

#define mod 998244353
long long power(long long a,long long b){
  long long x=1,y=a;
  while(b>0){
    if(b&1ll){
      x=(x*y)%mod;
    }
    y=(y*y)%mod;
    b>>=1;
  }
  return x%mod;
}

long long modular_inverse(long long n){
  return power(n,mod-2);
}

long long factorial[524288];
long long invfact[524288];

void cfact(){
  long long i;
  factorial[0]=1;
  factorial[1]=1;
  for(i=2;i<524288;i++){
    factorial[i]=factorial[i-1]*i;
    factorial[i]%=mod;
  }
  invfact[524287]=modular_inverse(factorial[524287]);
  for(i=524286;i>=0;i--){
    invfact[i]=invfact[i+1]*(i+1);
    invfact[i]%=mod;
  }
}

long long calcnCr(long long n,long long k){
  if(k<0 || n<k){return 0;}
  return (factorial[n]*((invfact[k]*invfact[n-k])%mod))%mod;
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cfact();

  long long n,m;
  cin >> n >> m;

  vector<vector<long long>> dp(31,vector<long long>(2,0));
  dp[0][1]=1;
  for(int tg=29;tg>=0;tg--){
    vector<vector<long long>> ndp(31,vector<long long>(2,0));
    for(int i=0;i<=30;i++){
      for(int j=0;j<2;j++){
        if(dp[i][j]==0){continue;}
        if(m&(1ll<<tg)){
          if(j==1){
            ndp[i][0]+=dp[i][j];
            ndp[i][0]%=mod;
            ndp[i+1][1]+=dp[i][j];
            ndp[i+1][1]%=mod;
          }
          else{
            ndp[i][j]+=dp[i][j];
            ndp[i][j]%=mod;
            ndp[i+1][j]+=dp[i][j];
            ndp[i+1][j]%=mod;
          }
        }
        else{
          if(j==1){
            ndp[i][j]+=dp[i][j];
            ndp[i][j]%=mod;
          }
          else{
            ndp[i][j]+=dp[i][j];
            ndp[i][j]%=mod;
            ndp[i+1][j]+=dp[i][j];
            ndp[i+1][j]%=mod;
          }
        }
      }
    }
    dp=ndp;
  }

  long long res=0;
  for(int i=0;i<=30;i++){
    for(int j=0;j<2;j++){
      long long ce=power(n,i);
      res+=dp[i][j]*ce;
      res%=mod;
    }
  }
  cout << res << "\n";
  return 0;
}