#include<iostream> using namespace std; int find(int m, int n){ int res = 0; for(int i = n-m+1; i>=1; i--){ for(int j = n-i-m+2; j >= 1; j--){ for(int k = n-j-i-m+3; k >= 1; k--){ for(int q = n-k-j-i-m+4; q >= 1; q-- ){ if(i+j+k+q == n && i>=j && j >= k && k >= q){ res++; //cout<<i<<" "<<j<<" "<<k<<" "<<q<<endl; } } } } } return res; } int main() { int m, n; cin>>m>>n; cout<<find(m, n); return 0; }