#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

// using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

mint pow2_sum(ll l, ll r) {
    mint rsum = mint::raw(2).pow(r) - 1;
    mint lsum = mint::raw(2).pow(l) - 1;
    return rsum - lsum;
}

int main() {
    ll N, M;
    cin >> N >> M;
    // 桁数については bitlen(N) + M - 1 桁ではある
    ll popcnt = 0;
    ll bitlgt = 0;
    for (ll i = 0; i < 30; i++) {
        if ((N >> i) & 1) {
            popcnt++;
            bitlgt = i + 1;
        }
    }
    /*// M が小さいときは愚直で
    if (M <= 0) {
        mint ans = 0;
        for (ll i = 0; i < M; i++) {
            mint p = mint(2).pow(i);
            ans += N * p;
        }
        cout << ans.val() << endl;
        return 0;
    }*/
    // M が大きいとき
    mint ans = 0;
    ll dketa = 0;
    ll uketa = 0;
    for (ll i = 0; i < bitlgt; i++) {
        // 下にシフトする
        ll nshift = (N >> i);
        for (ll j = 0; j < bitlgt; j++) {
            if ((nshift >> j) & 1) {
                uketa ^= (1 << j);
            }
        }
    }
    ans += mint(uketa) * mint::raw(2).pow(M - 1);
    for (ll i = 0; i < bitlgt; i++) {
        // 上にシフトする
        ll nshift = (N << i);
        for (ll j = 0; j < bitlgt; j++) {
            if ((nshift >> j) & 1) {
                dketa ^= (1 << j);
            }
        }
    }
    ans += mint(dketa);
    // debug_out(uketa, dketa);

    ll lower_keta = bitlgt;
    ll upper_keta = M - 1;
    if (popcnt % 2 == 1) {
        ans += pow2_sum(lower_keta, upper_keta);
    }
    cout << ans.val() << endl;
}