#include<cstdio>
#include<cmath>
#include<cstring>
#include<iostream>
#include<cctype>
#include<queue>
#include<vector>
#include<string>
#include<map>
#include<algorithm>
using namespace std;
typedef long long LL;
const int N=100005;
const LL mod=1e9+7;
const double eps=1e-8;
const double pi=acos(-1);
int main()
{
//    freopen("test1.in","r",stdin);
//    freopen("test1.out","w",stdout);
    LL n,m;
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%I64d%I64d",&n,&m);
        if(m>32)
            m=32;
        LL ans=0;
        while(n)
        {
            ans+=n/(((LL)1)<<m);
            n%=(((LL)1)<<m);
            m--;
        }
        printf("%I64d\n",ans);
    }
    return 0;
}
/*


*/