#include <bits/stdc++.h>
using namespace std;
#define rep(i, x, limit) for (long long i = (long long)x; i < (long long)limit; i++)
#define REP(i, x, limit) for (long long i = (long long)x; i <= (long long)limit; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define el endl
#define spa " "
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define YES cout << "YES" << el
#define NO cout << "NO" << el
#define inp(x) for(auto &i:x)cin>>i
#define eps (1e-10)
#define Equals(a,b) (fabs((a) - (b)) < eps )
#define debug(x) cerr << #x << " = " << x << el
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vs = vector<string>;
using vb = vector<bool>;
const double pi = 3.141592653589793238;
const int inf = 1073741823;
const ll infl = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";
const ll MOD = 998244353;
#include<atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using vm = vector<mint>;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll n,m;cin>>n>>m;
  vm MI(m+1),N2(m),N22(m);
  REP(i,1,m)MI[i]=mint(i).inv();
  rep(i,1,m)MI[i+1]*=MI[i];
  rep(i,0,m)N2[i]=mint(2).pow(n)-1-i;
  rep(i,0,m-1)N2[i+1]*=N2[i];
  rep(i,0,m)N22[i]=mint(2).pow(n-1)-1-i;
  rep(i,0,m-1)N22[i+1]*=N22[i];
  mint ans = N2[m-1] * MI[m]; // C(2^n-1, m)

bool ok;
if (n - 1 >= 60) ok = true;
else ok = ((1LL << (n - 1)) >= m);  // 等号あり

if (ok) {
  ans -= N2[0] * N22[m-2] * MI[m-1];
}
cout << ans.val() << el;
}