#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

template <class T, class U>
vector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }

template<class... Ts, class U>
auto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }

template<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }
template<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }
int main() {
    auto dp = make_v(10, 101, 1001, 0LL);
    for (int i = 0; i < 101; ++i) {
        dp[1][i][i] = 1;
    }
    for (int i = 1; i < 9; ++i) {
        for (int j = 0; j < 101; ++j) {
            for (int k = 0; k < 1001; ++k) {
                if(!dp[i][j][k]) continue;
                for (int l = j+1; l < 101; ++l) {
                    dp[i+1][l][k+l] += dp[i][j][k];
                }
            }
        }
    }
    int n, s;
    while(cin >> n >> s, n){
        ll ans = 0;
        for (int j = 0; j < 101; ++j) {
            ans += dp[n][j][s];
        }
        cout << ans << "\n";
    }
    return 0;
}
