#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
string exchange10to2(long long num) {
	if (0 == num)return "0";
	string ret;
	while (num) {
		if (1 == num % 2)ret += '1';
		else ret += '0';
		num /= 2;
	}
	reverse(all(ret));
	return ret;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	string sn = exchange10to2(n);
	int sz = sn.size();
	if (m - 1 < sz) {
		vector<int>v(sz + m - 1);
		rep(i, sn.size()) rep(j, m) v[i + j] += sn[i] - '0';
		mint ans = 0;
		rep(i, v.size()) ans += (v[i] % 2)*pow_mod(2, v.size() - i - 1, mod);
		cout << ans.val() << endl;
		return 0;
	}
	vector<int>v(sz * 2 - 1);
	rep(i, sz) rep(j, sz) v[i + j] += sn[i] - '0';
	mint ans = 0;
	// head
	rep(i, sz - 1) ans += (v[i] % 2)*pow_mod(2, sz + m - 2 - i, mod);
	// body
	ans += (v[sz - 1] % 2)*(pow_mod(2, m, mod) - pow_mod(2, sz - 1, mod));
	// tail
	rep(i, sz - 1) ans += (v[i + sz] % 2)*pow_mod(2, sz - 2 - i, mod);
	cout << ans.val() << endl;
	return 0;
}