#include<bits/stdc++.h>
#define N 300005
#define re register
#define ll long long
using namespace std;
int n,m,K,q;
inline void Rd(int &res){
    re char c;res=0;
    while(c=getchar(),c<48);
    do res=(res<<3)+(res<<1)+(c^48);
    while(c=getchar(),c>47);
}
int a[5],id[5],a1[5],c[5];
int calc(int x,int y,int z){
    int cnt=max(0,min((x+a[3]-1)/a[3],(z+a[1]-1)/a[1]));
    int res=cnt;
    x-=a[3]*cnt,z-=a[1]*cnt;
    if(x<=0&&z<=0)return res;
    if(z<=0)swap(x,z),swap(a[1],a[3]);
    cnt=max(0,min((y+a[3]-1)/a[3],(z+a[2]-1)/a[2]));
    res+=cnt;
    return res;
}
int main(){
    int T;
    Rd(T);
    while(T--){
        Rd(a[1]),Rd(a[2]),Rd(a[3]);
        id[1]=1,id[2]=2,id[3]=3;
        a1[1]=a[1];a1[2]=a[2];a1[3]=a[3];
        c[1]=a[1],c[2]=a[2],c[3]=a[3];
        int ans=1e9;
        do{
            a[1]=a1[id[1]];
            a[2]=a1[id[2]];
            a[3]=a1[id[3]];
            c[1]=a[1],c[2]=a[2],c[3]=a[3];
            int cnt=min((1000+a[2]-1)/a[2],(1000+a[1]-1)/a[1]);
            for(re int i=1;i<=cnt;i++){
                a[1]=c[1],a[2]=c[2],a[3]=c[3];
                int x=1000-a[2]*i,y=1000-a[1]*i;
                ans=min(ans,i+calc(x,y,1000));
            }
        }while(next_permutation(id+1,id+4));
        printf("%d\n",ans);
    }
    return 0;
}