Special Numbers

Theofanis really likes sequences of positive integers, thus his teacher (Yeltsa Kcir) gave him a problem about a sequence that consists of only special numbers.

Let's call a positive number special if it can be written as a sum of different non-negative powers of n. For example, for n=4 number 17 is special, because it can be written as 40+42=1+16=17, but 9 is not.

Theofanis asks you to help him find the k-th special number if they are sorted in increasing order. Since this number may be too large, output it modulo 109+7.

Input

The first line contains a single integer t (1≤t≤104) — the number of test cases.

The first and only line of each test case contains two integers n and k (2≤n≤109; 1≤k≤109).

Output

For each test case, print one integer — the k-th special number in increasing order modulo 109+7.

Example

input

Copy

3
3 4
2 12
105 564

output

Copy

9
12
3595374

Note

For n=3 the sequence is [1,3,4,9...]

思路：这是一道位运算题，与 （a 乘 b 对 p 取模的值）极其相似。

 a 乘 b 对 p 取模的值  代码：

#include <iostream>
#include <algorithm>

using namespace std;

typedef long long ll;

ll p;

ll qadd(ll a,ll b)
{
    ll res=0;
    while(b)
    {
        if(b&1) res=(res+a)%p;
        a=(a+a)%p;
        b>>=1;

    }
    return res;
}

int main()
{
    ll a,b;
    cin>>a>>b>>p;
    cout<<qadd(a,b)<<endl;
    return 0;
}

次方的（本题的）：

#include <iostream>
#include <algorithm>
#include <cstring>

using namespace std;

typedef long long ll;
const int mod=1e9+7;

int main()
{
    int t;
    cin>>t;
    int n,k;
    while(t--)
    {
        cin>>n>>k;
        ll res=0;
        ll p=1;
        for(int i=0;i<=31;i++)
        {
            if(k&(1<<i))
            {
                res=(res+p)%mod;
            }
            p*=n;
            p%=mod;
        }
        cout<<res<<endl;
    }
    return 0;
}

两者只有一点区别：在a*b中  a的变化是 a=a+a（因为是乘法，有b个a相加 便成a*b）

而a的次方中  a的变化是 a=a*a（这里用了 p=1，p=p*a 代替）因为是k个a相乘