#include <bits/stdc++.h>
#define int long long
using namespace std;

const int N = 100, mod = 998244353;
int n, m, num, f[N][2];
void add(int &x, int y) {x = (x + y) % mod; }
struct matrix{
	int g[3][3];
	matrix() {memset(g, 0, sizeof(g)); }
	matrix operator * (const matrix &y) const {
		matrix ret;
		for (int i=0; i<3; ++i)
			for (int k=0; k<3; ++k)
				for (int j=0; j<3; ++j)
					add(ret.g[i][j], g[i][k] * y.g[k][j]);
		return ret;
	}
}h;
matrix power(matrix x, int y) {
	matrix ret;
	for (int i=0; i<3; ++i) ret.g[i][i] = 1;
	while (y) {
		if (y & 1) ret = ret * x;
		x = x * x, y >>= 1;
	}
	return ret;
}

void pre() {
	h.g[0][1] = h.g[0][2] = h.g[1][0] = h.g[2][1] = 1;
	h = power(h, n);
	for (int i=0; i<3; ++i)
		num = (num + h.g[i][i]) % mod;
}

signed main() {
	cin >> n >> m;
	pre();
	f[0][0] = 1;
	for (int i=0; i<=32; ++i) {
		if (!((m >> i) & 1)) {
			add(f[i + 1][0], f[i][0]), add(f[i + 1][1], f[i][0]);
			add(f[i + 1][1], f[i][1] * num);
		} else {
			add(f[i + 1][0], f[i][1]), add(f[i + 1][1], f[i][1]);
			add(f[i + 1][0], f[i][0] * num); 
		}
	}
	cout << f[32][0] << "\n";
	return 0;
}