I have a set of super poker cards，consisting of an infinite number of cards．For each positive integer ，there are exactly four cards whose value is ：Spade（），Heart（），Club（） and Diamond（）．There are no cards of other values．
Given two positive integers and ，how many ways can you pick up at most cards whose values sum to ？For example，if and ，ne way is ，shown below：
输入格式
There will be at most test cases，each with two integers and ．The input is terminated by ．
输出格式
For each test case，print the number of ways，modulo ．
