#include <iostream>
#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
using namespace std;
#pragma warning (disable: 4996)

long long mod = 998244353;
long long N, M;
long long dp[1000009];

int main() {
	cin >> N >> M;
	if (N == 1) {
		cout << "1" << endl;
		return 0;
	}
	dp[0] = 1;
	for (int i = 1; i <= M; i++) {
		dp[i] = dp[i - 1];
		if (i - N >= 0) dp[i] += dp[i - N];
		dp[i] %= mod;
	}
	cout << dp[M] << endl;
	return 0;
}