#ifndef HIDDEN_IN_VS // 折りたたみ用

// 警告の抑制
#define _CRT_SECURE_NO_WARNINGS

// ライブラリの読み込み
#include <bits/stdc++.h>
using namespace std;

// 型名の短縮
using ll = long long; using ull = unsigned long long; // -2^63 ～ 2^63 = 9e18（int は -2^31 ～ 2^31 = 2e9）
using pii = pair<int, int>;	using pll = pair<ll, ll>;	using pil = pair<int, ll>;	using pli = pair<ll, int>;
using vi = vector<int>;		using vvi = vector<vi>;		using vvvi = vector<vvi>;	using vvvvi = vector<vvvi>;
using vl = vector<ll>;		using vvl = vector<vl>;		using vvvl = vector<vvl>;	using vvvvl = vector<vvvl>;
using vb = vector<bool>;	using vvb = vector<vb>;		using vvvb = vector<vvb>;
using vc = vector<char>;	using vvc = vector<vc>;		using vvvc = vector<vvc>;
using vd = vector<double>;	using vvd = vector<vd>;		using vvvd = vector<vvd>;
template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
using Graph = vvi;

// 定数の定義
const double PI = acos(-1);
int DX[4] = { 1, 0, -1, 0 }; // 4 近傍（下，右，上，左）
int DY[4] = { 0, 1, 0, -1 };
int INF = 1001001001; ll INFL = 4004004003094073385LL; // (int)INFL = INF, (int)(-INFL) = -INF;

// 入出力高速化
struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;

// 汎用マクロの定義
#define all(a) (a).begin(), (a).end()
#define sz(x) ((int)(x).size())
#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), (x)))
#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), (x)))
#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}
#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 から n-1 まで昇順
#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s から t まで昇順
#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s から t まで降順
#define repe(v, a) for(const auto& v : (a)) // a の全要素（変更不可能）
#define repea(v, a) for(auto& v : (a)) // a の全要素（変更可能）
#define repb(set, d) for(int set = 0, set##_ub = 1 << int(d); set < set##_ub; ++set) // d ビット全探索（昇順）
#define repis(i, set) for(int i = lsb(set), bset##i = set; i < 32; bset##i -= 1 << i, i = lsb(bset##i)) // set の全要素（昇順）
#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て（昇順）
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去
#define EXIT(a) {cout << (a) << endl; exit(0);} // 強制終了
#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) // 半開矩形内判定

// 汎用関数の定義
template <class T> inline ll powi(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新（更新されたら true を返す）
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新（更新されたら true を返す）
template <class T> inline int getb(T set, int i) { return (set >> i) & T(1); }
template <class T> inline T smod(T n, T m) { n %= m; if (n < 0) n += m; return n; } // 非負mod

// 演算子オーバーロード
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }
template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }

#endif // 折りたたみ用


#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;

#ifdef _MSC_VER
#include "localACL.hpp"
#endif

using mint = modint998244353;
//using mint = static_modint<(int)1e9+7>;
//using mint = modint; // mint::set_mod(m);

using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>; using pim = pair<int, mint>;
#endif


#ifdef _MSC_VER // 手元環境（Visual Studio）
#include "local.hpp"
#else // 提出用（gcc）
int mute_dump = 0;
int frac_print = 0;
#if __has_include(<atcoder/all>)
namespace atcoder {
	inline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
	inline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
}
#endif
inline int popcount(int n) { return __builtin_popcount(n); }
inline int popcount(ll n) { return __builtin_popcountll(n); }
inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : 32; }
inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : 64; }
inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }
inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }
#define dump(...)
#define dumpel(v)
#define dump_math(v)
#define input_from_file(f)
#define output_to_file(f)
#define Assert(b) { if (!(b)) { vc MLE(1<<30); rep(i,9)cout<<MLE[i]; } } // RE の代わりに MLE を出す
#endif


//【階乗などの埋め込み】
/*
* 階乗とその逆数を埋め込み，任意の n に対し n!, 1/n! を O(WIDTH) で得られるようにする．
* AtCoder の提出コードは 512KB が上限なので，WIDTH ≧ 4*10^4 あたりが限界．
*/
const int WIDTH = (int)1e7; int MOD = mint::mod();
void embed_factorial() {
	// verify : https://judge.yosupo.jp/problem/many_factorials

	mint fac = 1;
	vm res;
	rep(i, MOD) {
		if (i % WIDTH == 0) res.emplace_back(fac);
		if (i < MOD - 1) fac *= i + 1;
	}

	mint fac_inv = fac.inv();
	vm res_inv;
	rep(i, MOD) {
		if (i % WIDTH == 0) res_inv.emplace_back(fac_inv);
		fac_inv *= MOD - 1 - i;
	}

	cout << "vi FACT={";
	rep(i, sz(res)) cout << res[i] << (i < sz(res) - 1 ? "," : "};\n");

	cout << "vi FACT_INV={";
	rep(i, sz(res_inv)) cout << res_inv[i] << (i < sz(res_inv) - 1 ? "," : "};\n");

	exit(0);

	/* 埋め込んだテーブルを元に階乗やその逆数の値を計算する．
	mint fac(ll n) {
		if (n >= MOD) return 0;
		ll q = n / WIDTH;
		mint res = FACT[q];
		repi(i, q * WIDTH + 1, n) res *= i;
		return res;
	}

	mint fac_inv(ll n) {
		Assert(n < MOD);
		ll q = (MOD - 1 - n) / WIDTH;
		mint res = FACT_INV[q];
		repi(i, q * WIDTH + 1, MOD - 1 - n) res *= MOD - i;
		return res;
	}
	*/
}
vi FACT = { 1,295201906,160030060,957629942,545208507,213689172,760025067,939830261,506268060,39806322,808258749,440133909,686156489,741797144,390377694,12629586,544711799,104121967,495867250,421290700,117153405,57084755,202713771,675932866,79781699,956276337,652678397,35212756,655645460,468129309,761699708,533047427,287671032,206068022,50865043,144980423,111276893,259415897,444094191,593907889,573994984,892454686,566073550,128761001,888483202,251718753,548033568,428105027,742756734,546182474,62402409,102052166,826426395,159186619,926316039,176055335,51568171,414163604,604947226,681666415,511621808,924112080,265769800,955559118,763148293,472709375,19536133,860830935,290471030,851685235,242726978,169855231,612759169,599797734,961628039,953297493,62806842,37844313,909741023,689361523,887890124,380694152,669317759,367270918,806951470,843736533,377403437,945260111,786127243,80918046,875880304,364983542,623250998,598764068,804930040,24257676,214821357,791011898,954947696,183092975 };
vi FACT_INV = { 998244352,703042447,838214293,40614411,453035846,784555181,238219286,58414092,491976293,958438031,189985604,558110444,312087864,256447209,607866659,985614767,453532554,894122386,502377103,576953653,881090948,941159598,795530582,322311487,918462654,41968016,345565956,963031597,342598893,530115044,236544645,465196926,710573321,792176331,947379310,853263930,886967460,738828456,554150162,404336464,424249369,105789667,432170803,869483352,109761151,746525600,450210785,570139326,255487619,452061879,935841944,896192187,171817958,839057734,71928314,822189018,946676182,584080749,393297127,316577938,486622545,74132273,732474553,42685235,235096060,525534978,978708220,137413418,707773323,146559118,755517375,828389122,385485184,398446619,36616314,44946860,935437511,960400040,88503330,308882830,110354229,617550201,328926594,630973435,191292883,154507820,620840916,52984242,212117110,917326307,122364049,633260811,374993355,399480285,193314313,973986677,783422996,207232455,43296657,815151378 };


mint fac(ll n) {
	if (n >= MOD) return 0;
	ll q = n / WIDTH;
	mint res = FACT[q];
	repi(i, q * WIDTH + 1, n) res *= i;
	return res;
}

mint fac_inv(ll n) {
	Assert(n < MOD);
	ll q = (MOD - 1 - n) / WIDTH;
	mint res = FACT_INV[q];
	repi(i, q * WIDTH + 1, MOD - 1 - n) res *= MOD - i;
	return res;
}


//【桁の数の取得（桁数固定）】O(log n)
/*
* n を len 桁で b 進表記したときの桁の数字を上位桁から順に並べたリストを返す．
*
* 制約：b ≧ 2
*/
vi integer_digits(ll n, int len, int b = 10) {
	// verify : https://yukicoder.me/problems/no/327

	Assert(abs(b) >= 2);

	// mod |b| を取れば最下位桁から順に決定していく．
	vi ds(len);
	rep(i, len) {
		int d = (int)(n % b);
		//int d = (int)smod(n, abs(b)); // 負数の可能性があるならこっち
		ds[len - 1 - i] = d;
		n = (n - d) / b;
	}

	return ds;
}


int main() {
//	input_from_file("input.txt");
//	output_to_file("output.txt");

//	embed_factorial();

	ll n, k;
	cin >> n >> k;

	auto ns = integer_digits(n, 2, 998244353);
	auto ks = integer_digits(k, 2, 998244353);

	mint res = 1;

	rep(i, 2) res *= fac(ns[i]) * fac_inv(ns[i] - ks[i]) * fac_inv(ks[i]);

	EXIT(res);
}