#include<bits/stdc++.h>usingnamespace std;voidextend_gcd(longlong a,longlong b,longlong&x,longlong&y){if(b==0){x=1,y=0;return;}extend_gcd(b,a%b,x,y);longlong tmp=x;
x=y,y=tmp-(a/b)*y;}longlongmod_inverse(longlong a,longlong m){longlong x,y;extend_gcd(a,m,x,y);return(m+x%m)%m;}intmain(){longlong t,a,b;
cin>>t;while(t--){
cin>>a>>b,cout<<(a*mod_inverse(b,9973))%9973<<endl;;}return0;}/*逆元与除法取模,由于a,b都是很大的数,做除法后再取模会损失精度
设:b的逆元是k:
(a/b) mod m = ((a/b) mod m)((bk) mod m)
= ((a/b)*b*k) mod m
= (a*k) mod m
*/