PROGRAMMING:Counting coins
Suppose a pile of n coins composed of 1, 2 and 5 cents has a total face value of M cents, and find out how many possible combinations there are (the number of coins with a certain face value can be 0).
###Input format:
There is a positive integer t in the first line of input data, which means there are t groups of test data;
The next t line, each line has two numbers n, m, N and m.
###Output format:
For each group of test data, please output the number of possible combinations;
Each output occupies one line.
###Input example:
Here is a set of inputs. For example:
```in
two
3 5
4 8
```
###Output example:
The corresponding output is given here. For example:
```out
one
two
```
answer：If there is no answer, please comment
###Input format:
There is a positive integer t in the first line of input data, which means there are t groups of test data;
The next t line, each line has two numbers n, m, N and m.
###Output format:
For each group of test data, please output the number of possible combinations;
Each output occupies one line.
###Input example:
Here is a set of inputs. For example:
```in
two
3 5
4 8
```
###Output example:
The corresponding output is given here. For example:
```out
one
two
```
answer：If there is no answer, please comment