#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;
#define INF 100000000
#define MAXS 1024
#define MAXN 10
#define MAXNUM 100
typedef long long ll;

ll dp[MAXN][MAXS];
int n, s;

int main(void) {
    dp[0][0] = 1;
    for(int i = 0; i <= 100; ++i){
        for(int j = 1000; j >= i; --j){
            for(int k = 9; k > 0; --k){
                dp[k][j] += dp[k-1][j-i];
            }
        }
    }
    while (1) {
        cin >> n >> s;
        if (n == 0 && s == 0) break;
        cout << dp[n][s] << endl;
    }
    return 0;
}