#include <bits/stdc++.h>
#include <algorithm>

#define endl '\n';


const int N = 1e6 + 10;
const int M = 2e6 + 10;
const int P = 998244353; 
const int Base = 3221225477;
const int INF = 0x3f3f3f3f3f3f3f3f; 

int mod(int x)
{
   return x % P;
}
using namespace std;
int s,k;
signed main()
{
	cin >> k >> s;
	int cnt = 0;
	for(int x = 0; x <= k;x++)
	{
		for(int y = 0;y <= k;y++)
		{
			int z = s - x - y;
			if(0 <= z && z <= k)
			{
				cnt++;
			}
		}
	}
	cout << cnt << endl;
	
	
	
	
	return 0;
}