Description

Given a monetary system with $n$ different denominations, find the number of ways to make up a value of $m$.

Input Format

The first line contains $n$ and $m$.

Output Format

A single line containing the number of possible combinations.

Sample

3 10        //3 denominations to make up value 10
1           //denomination 1
2           //denomination 2
5           //denomination 5

10          //10 possible combinations