BEHAPPY - Be Awesome As Barney Stinson


Barney Stinson ;) is way too flirty. He has many girlfriends and he wants to keep all of them happy. He has M girlfriends. He bought N gifts for them. Now he knows that some girlfriends need more gifts and some need less. So he decided that he will give atleast Ai gifts and at most Bi gifts to his ith girlfriend. He has to give away all the N gifts. Tell us in how many different ways he can do this.

INPUT

For each test case, first line contains two integers M and N, then follows M lines each having two integers Ai and Bi (1 <= i <= M). Input ends with M and N both equal to 0 and that case should not be processed.

OUTPUT:

For each test case, output the number of different ways in which he can distribute those gifts in a single line.

Constraints

1 <= M <= 20, 1 <= N <= 100, 0 <= Ai, Bi <=100

Example

Input:

3 5
0 1
1 3
1 4
0 0

Output:

6

Explanation

He can distribute 5 gifts in his 3 girlfriends in 6 different ways as follows (0 1 4), (0 2 3), (0 3 2), (1 1 3), (1 2 2), (1 3 1).


hide comments
kejriwal: 2016-01-16 17:49:31

solve to increase your confidence in dp :) !

hodobox: 2015-12-29 02:59:25

Solved it as knapsack in O( (Bi-Ai)*n*m )

Prateek Agarwal: 2015-12-04 08:58:35

No memoization required

spoj2121: 2015-12-01 17:43:28

weak test case backtracking gets AC in 0.00 sec..

Last edit: 2015-12-01 17:43:43
Saksham : 2015-08-13 00:49:58

Nice one

sarvagya: 2015-08-07 02:24:40

learnt a lot about dp with this ! 0.00 AC :D

:.Mohib.:: 2015-06-30 06:54:55

Nice one :)

Rishabh Joshi: 2015-03-19 17:56:19

better constraints, same question. Try http://www.spoj.com/problems/UOFTAE/

a b : 2015-02-23 18:16:53

cases are very weak , exponential order gets AC

Abhishek: 2014-12-12 17:49:08

Any of Recursion and Backtracking will do.


Added by:Ankit Kumar Vats
Date:2011-10-21
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:Inspired