#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
long long mod = 998244353;
long long Fibonacci (long long A){
    vector<long long>B(A+1);B[0]=1;B[1]=1;
    for(int i=2;i<=A;i++){B[i]=B[i-1]+B[i-2];B[i]%=mod;}
    return B[A];
}
#define int long long
signed main() {
    int N, M; cin >> N >> M;
    if (N == 1) { cout << 1 << endl; return 0; }
    vector<int>A(M+1);
    for(int i=0;i<min(M,N);i++){
        A[i]=1;
    }
    for(int i=N;i<=M;i++){
        A[i]=A[i-N]+A[i-1];
    }
    cout <<A[M-1]<< endl;
}