#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int Len(int x)
{
	int len=0;
	while(x) len++,x/=10;
	return len;
}
int H[2000005];
inline void solve()
{
	string n;
	int m;
	cin>>n>>m;
	reverse(n.begin(),n.end());
	for(int i=0;i<=15;i++) n+='0';
	reverse(n.begin(),n.end());
	int ans=0;
	for(int i=0;i<n.size();i++) ans=ans*10+n[i]-48,ans%=m;
	ans=m-ans;
	if(ans==0) ans=m;

	int lenm=Len(m);
	int Mm=pow(10,lenm);
	int G=1;
	int bak=1;
	for(int i=n.size()-1;i>=lenm-1;i--,G=(G<1000000000?G*10:G))
	{
		int s=0;
		for(int j=i-lenm+1;j<=i;j++)s=s*10+n[j]-48;

		if(G==1000000000)
		{
			if(s==m)
			{
				if(bak>1) ans=1;
			}
			else
			{
				if(m-s==1 || (Mm+m-s)==1)
				{
					ans=min(ans,bak);
				}
			}

			if(n[i]!='9') bak=m+5;
			continue;
		}

		if(m==s)
		{
			if(bak!=1)
			{
				ans=1;
				break;
			}
		}

		int turn=(m-s);
		if(turn<=0) turn+=Mm;
		turn--;

		 cout<<turn<<" "<<bak<<" "<<s<<" "<<m<<" "<<G<<endl;

		ans=min(ans,turn*G+bak);

		bak=bak+(9-(n[i]-48))*G;	
	}
	// cout<<ans<<" ";

	for(int i=0;i<n.size();i++) H[i]=n[n.size()-i-1]-48;
	H[0]+=ans;
	for(int i=0;i<n.size();i++)
	{
		H[i+1]+=H[i]/10;
		H[i]%=10;
	}
	bool d0=1;
	for(int i=n.size();i>=0;i--)
	{
		if(H[i])
		{
			d0=0;
			cout<<H[i];
		}
		else if(!d0) cout<<H[i];
	}
	cout<<endl;	
}
signed main(){
	int T;
	cin>>T;
	while(T--) solve();
}