#include <cstdio>
#include <algorithm>
#include <cstdlib>

using namespace std;

int a[33100], b[33100];
int n, s, i, j; 

int main(){
    freopen("1-sir.in", "r", stdin);
    freopen("1-sir.out", "w", stdout);
    
    scanf("%d%d", &n, &s);
    
    if (abs(s) > n * (n + 1) / 2) {
        printf("0\n");
        return 0;        
    }
    
    a[0] = 1;
    
    for (i = 2; i <= n; i++) {
        memset(b, 0, sizeof(b));
        for (j = 0; j <= (i * (i + 1) / 2) ; j++) {
            b[j] += a[abs(j - i + 1)];
            b[j] += a[j + i - 1];
        }
        
        memcpy(a, b, sizeof(b));
    }
    
    printf("%d\n", b[abs(s)]);

    return 0;
}