This problem is a programming version of Problem 53 from projecteuler.net
There are exactly ten ways of selecting three from five, :
In combinatorics, we use the notation,
It is not until , that a value exceeds one-million:
How many, not necessarily distinct, values of , for , are greater than K?
Input contains two integers and .
Print the answer corresponding to the test case.