#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using ll = long long;
using mint = atcoder::modint998244353;
#define rep(i,n) for (int i = 0; i < n; i++)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define rep2(i,a,b) for (int i = a; i < b; i++)
#define rrep2(i,a,b) for (int i = a-1; i >= b; i--)
#define rep3(i,a,b,c) for (int i = a; i < b; i+=c)
#define rrep3(i,a,b,c) for (int i = a-1; i >= b; i-=c)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
template<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}
template<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}

ll n,m;
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>n>>m;
    int c=30;
    rrep(i,30){
        if(n>>i&1){
            c=i;
            break;
        }
    }
    if(c<m){
        int x=0,y=0;
        mint ans=0;
        rep(i,c){
            x^=(n>>i&1);
            if(x)ans+=mint(2).pow(i);
        }
        rrep2(i,c+1,1){
            y^=(n>>i&1);
            if(y)ans+=mint(2).pow(i+m-1);
        }
        y^=(n&1);
        if(!y)cout<<ans.val()<<"\n";
        else{
            ans+=mint(2).pow(m)-mint(2).pow(c);
            cout<<ans.val()<<"\n";
        }
    }else{
        ll ans=0;
        rep(i,m){
            ans^=(1LL<<i)*n;
        }
        cout<<ans%998244353<<"\n";
    }
}