#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;
using mint = modint998244353;
using vm = vector<mint>;

int main() {
	lint N, M;
	cin >> N >> M;

	mint a=0, b=0, c=0;
	lint x, y, z;
	if (M <= 32) {
		x = 0;
		rep(i, M) {
			x ^= N;
			N <<= 1;
		}
		a = x;
		std::cout << a.val() << '\n';
		exit(0);
	}
	x = __builtin_popcount(N);
	a = 1;
	y = 0;
	z = 31;
	rep(i, z) {
		if ((N&((lint)1<<i)) != 0) y++;
		if (y&1) b += a;
		a *= 2;
	}
	a = 2;
	a = a.pow(M+z-2);
	y = 0;
	rep(i, z) {
		if ((N&((lint)1<<(z-i-1))) != 0) y++;
		if (y&1) b += a;
		a /= 2;
	}
	if (x&1) {
		a = 2;
		a = a.pow(M-z-1);
		c = (lint)1<<z;
		b += c*(a-1);
	}
	std::cout << b.val() << '\n';
}