#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
	int n, m; cin>>n>>m;
	if(n==1){
	    cout<<1<<endl;
	    return 0;
	}
	const ll MOD=998244353;
	ll dp[1000010];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;
}