import java.util.*;
// warm-up
// Even better without extra space with a simple branch. Thanks to Editorial. 
// Technically no need for another loop and a map to cross check.
public class Main {

	static void solve() {
		Scanner sc = new Scanner(System.in);
		int K = sc.nextInt(), s = sc.nextInt(), t=0;
		for (int i=0; i<=K; i++) {
			for (int j=0; j<=K; j++) {
				int z = s-i-j;
				if (z>=0 && z<=K) t++;
			}
		}
		System.out.println(t);
		sc.close();			
	}

	public static void main(String args[]) {
		solve();
	}

}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz