#include <iostream>
#include <algorithm>
using namespace std;

long long  memo[101][10][1001];

long long dfs(int i, int j, int k)
{
    long long res = 0;
    if(j == 0 && k == 0) {
        return 1;
    } else if(i > 100 || j < 0 || k < 0){
        return 0;
    } else if(memo[i][j][k] >= 0){
        return memo[i][j][k];
    } else {
        res += dfs(i + 1, j, k);
        res += dfs(i + 1, j - 1, k - i);
    }
    return memo[i][j][k] = res;
}

int main()
{
    fill((long long*)memo, (long long*)(memo + 101), -1);
    int n, s;
    while(cin>> n >> s, n || s){
        cout << dfs(0, n, s) << endl;
    }
}