Sequence of Sequence
##### Submissions: 2206   Accuracy: 54.83%   Difficulty: Easy   Marks: 2

Given two integers m & n, find the number of possible sequences of length n such that each of the next element is greater than or equal to twice of the previous element but less than or equal to m.

Input:
First line consists of test case T. Only line of every test case consists of 2 integers M and N.

Output:
Single line output, number of sequences possible.

Constraints:
1<=T<=100
1<=M,N<=100

Example:
Input:

2
10 4
5 2
Output:
4
6

Explanation:
Input : m = 10, n = 4
Output : 4
There should be n elements and value of last
element should be at-most m.
The sequences are {1, 2, 4, 8}, {1, 2, 4, 9},
{1, 2, 4, 10}, {1, 2, 5, 10}

Input : m = 5, n = 2
Output : 6
The sequences are {1, 2}, {1, 3}, {1, 4},
{1, 5}, {2, 4}, {2, 5}

#### ** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Saksham Raj Seth
Author: saksham seth

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.