#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 3;
int T;
int n, num;
using i64 = long long;

void work(){
	string s;
	int m;cin >> s >> m;
	
	auto accumstr = [] (const string &x,const string &y) {
		string s = x,t = y;	
		int n = s.size(),m = t.size();
		reverse(s.begin(),s.end());
		reverse(t.begin(),t.end());
		int i = 0,j = 0,pre = 0;
		string now = "";
		while(i < n || j < m || pre) {
			if(i < n) {
				pre += s[i] - '0';
				i += 1;
			}
			if(j < m) {
				pre += t[j] - '0';
				j += 1;
			}
			now += ('0' + pre % 10);
			pre /= 10;
		}
		reverse(now.begin(),now.end());
		return now;
	};
	
	auto accum = [&] (const string &s,int p) {
		return accumstr(s,to_string(p));
	};
	
	s = accum(s,1);
	i64 p = 0;
	for(int i = 0;i < (int)s.size();i++) p = (p * 10 + s[i] - '0') % m;
	
	auto cmp = [&] (const string &x,const string &y) {
		if(x.size() > y.size()) return 1;
		if(x.size() < y.size()) return 0;
		if(x > y) return 1;
		return 0;
	};
	
	string M = to_string(m);
	if(s.find(M) != s.npos) {
		cout << s << '\n';
		return;
	}
	string ans = accum(s,(m - p) % m);
	auto change = [&] (const string &s,int x) {
		string now = s;
		reverse(now.begin(),now.end());
		while(now.size() < (int)M.size() + x) now += '0';
		reverse(now.begin(),now.end());
		int fir = now.size() - x - (int)M.size();
		for(int i = 0;i < (int)M.size();i++) now[fir + i] = M[i];
		return now;
	};
	for(int i = 0;i < 20;i++) {
		string now = change(s,i);
		if(cmp(s,now)) continue;
		int len = now.size();
		for(int j = 0;j < i;j++) now[len - 1 - j] = '0';
		if(cmp(ans,now)) swap(ans,now);
	}
	cout << ans << '\n';
}


int main(){
//	freopen("test.txt", "r", stdin);
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> T;
	while(T--){
		work();
	}	
	return 0;
}