#include using namespace std; int a[5],ans; int P1(){ int ans=0; int b=999/a[2]+1;ans+=b; int c=1000-a[1]*b; if(c<=0)return ans; int d=999/a[2]+1; int e=(c-1)/a[0]+1; ans+=min(d,e); return ans; } int P2(){ int ans=1000; int x=1000,y=1000; for(int i=0;i<=1000;++i){ if(x<=0 || y<=0)break; int b=(x-1)/a[2]+1,c=(y-1)/a[2]+1; ans=min(ans,b+c+i); x-=a[0];y-=a[1]; } return ans; } void solve(){ ans=1e9; scanf("%d%d%d",&a[0],&a[1],&a[2]); sort(a,a+3); ans=min(ans,P1()); ans=min(ans,P2()); printf("%d\n",ans); } int main(){ int t;scanf("%d",&t); for(;t;--t)solve(); return 0; }