#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<vector>
#include<cmath>
using namespace std;

const int mx=100005;

int pow(int m)
{
    int ans=1;
    for (int i=0;i<m;i++) 
    {
        ans*=2;
        if (ans>=1000000000) return ans;
    }
    return ans;
}

int main()
{
    int t;
    scanf("%d",&t);
    while (t--)
    {
        int n,m;
        scanf("%d%d",&n,&m);
        int ans=0;
        m=min(32,m);
        while (m>=0)
        {
            ans+=n/pow(m);
            n=n%pow(m);
            m--;
        }
        printf("%d\n",ans);
    }
}