/* Code by Heratino & Nelofus */
// No I still can't seem to
// Sing more than blues when it's time for my verse
// It's true that I need you
// To turn my blues into bursting fireworks
#include <bits/stdc++.h>
using i64 = long long;

//{{{
template<typename Ta, typename Tb>
inline void chkmax(Ta &a, const Tb &b) {if (a < b)	a = b;}
template<typename Ta, typename Tb>
inline void chkmin(Ta &a, const Tb &b) {if (a > b)	a = b;}
//}}}

constexpr int N = 32;
constexpr int mod = 998244353;
constexpr inline int Add(const int &x, const int &y) {return x + y >= mod ? x + y - mod : x + y;}
constexpr inline int Sub(const int &x, const int &y) {return x - y < 0 ? x - y + mod : x - y;}
constexpr inline void AddTo(int &x, const int &y) {x = Add(x, y);}
constexpr inline void SubTo(int &x, const int &y) {x = Sub(x, y);}

struct matrix {
	int a[3][3];
	matrix() {memset(a, 0, sizeof(a));}
	constexpr int* operator [] (const int &x) {return a[x];}
	friend matrix operator * (matrix &A, matrix &B) {
		matrix C;
		for (int i = 0; i < 3; i++)
			for (int j = 0; j < 3; j++)
				for (int k = 0; k < 3; k++)
					AddTo(C[i][j], 1ll * A[i][k] * B[k][j] % mod);
		return C;
	}
};

int f[N][2];
inline matrix fpow(matrix x, int k) {
	matrix res;
	for (int i = 0; i < 3; i++)
		res[i][i] = 1;
	for (; k; k >>= 1, x = x * x)
		if (k & 1)
			res = res * x;
	return res;
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

	int n, m;
	std::cin >> n >> m;
	if (m == 0) {
		std::cout << 1 << '\n';
		return 0;
	}

	matrix trans;
	trans[0][0] = 0, trans[0][1] = 1, trans[0][2] = 0;
	trans[1][0] = 0, trans[1][1] = 0, trans[1][2] = 1;
	trans[2][0] = 1, trans[2][1] = 1, trans[2][2] = 0;
	matrix t = fpow(trans, n - 3);
	int w = (2ll * t[2][1] + 3ll * t[2][2]) % mod;
	
	int k = std::__lg(m) + 1;
	f[0][0] = 1;
	for (int i = 0; i < k; i++) {
		// 为 0 的转移
		if (m >> i & 1)
			AddTo(f[i + 1][0], 1ll * w * f[i][0] % mod);
		else
			AddTo(f[i + 1][1], f[i][0]), AddTo(f[i + 1][0], f[i][0]);
		// 为 1 的转移
		if (m >> i & 1)
			AddTo(f[i + 1][0], f[i][1]), AddTo(f[i + 1][1], f[i][1]);
		else
			AddTo(f[i + 1][1], 1ll * w * f[i][1] % mod);
	}
	std::cout << f[k][0] << '\n';
	return 0;
}