import std.stdio, std.string, std.conv;
import std.array, std.algorithm, std.range;
import std.math;

void main()
{
    immutable N = 100;
    immutable S = N*(N+1)/2;
    auto a = stdin.byLine().map!(s=>s.split().map!(to!int).array()).array().until!(a=>a[0]==0&&a[1]==0).array();
    int n=0, s=0;
    foreach(v;a) n=max(n,v[0]),s=max(s,v[1]);
    n=min(n,N);
    s=min(s,S-(N-n)*(N-n+1)/2);
    auto dp = new long[][](n+1,s+1);
    dp[0][0]=1;
    foreach(i;0..min(s,N)+1)
        foreach_reverse(j;0..n)
            foreach(k;0..s-i+1)
                dp[j+1][k+i]+=dp[j][k];
    foreach(v;a)
        writeln(v[0]>n||v[1]>s?0:dp[v[0]][v[1]]);
}