PROGRAMMING:Bee Movie
#####Problem description
There is a trained bee that can only crawl to the right side of the adjacent hive, and can not crawl backwards. Please program to calculate the number of possible routes for bees to climb from hive a to hive B. The structure of the hive is shown below.
#####Enter a description
The first line of input data is an integer n, which represents the number of test cases, and then n lines of data, each line contains two integers a and B (0 < a < B < 50).
###Output description
For each test instance, please output the number of possible routes for bees to climb from hive a to hive B, and the output of each instance occupies one line.
#####Input sample
```in
two
1 2
3 6
```
#####Output sample
```out
one
three
```
answer：If there is no answer, please comment
There is a trained bee that can only crawl to the right side of the adjacent hive, and can not crawl backwards. Please program to calculate the number of possible routes for bees to climb from hive a to hive B. The structure of the hive is shown below.
#####Enter a description
The first line of input data is an integer n, which represents the number of test cases, and then n lines of data, each line contains two integers a and B (0 < a < B < 50).
###Output description
For each test instance, please output the number of possible routes for bees to climb from hive a to hive B, and the output of each instance occupies one line.
#####Input sample
```in
two
1 2
3 6
```
#####Output sample
```out
one
three
```
answer：If there is no answer, please comment