#include<bits/stdc++.h>
#define ls ch[x][0]
#define rs ch[x][1]
#define ll long long
using namespace std;

inline ll read(){
    ll num=0,neg=1;char c=getchar();
    while(!isdigit(c)){if(c=='-')neg=-1;c=getchar();}
    while(isdigit(c)){num=(num<<3)+(num<<1)+c-'0';c=getchar();}
    return num*neg;
}

int T,a[4],h[4];

bool cmp1(int x,int y){return x>y;}

int main(){
    T=read();
    while(T--)
    {
        a[1]=read(),a[2]=read(),a[3]=read();
        sort(a+1,a+4,cmp1);
        if(a[1]==1) printf("1000\n");
        else{
            int ans=998244353;
            for(int i=0;i<=501;i++)
            {
                for(int j=0;j<=501;j++)
                {
                    h[1]=1000-a[2]*i-a[3]*j,
                    h[2]=1000-a[1]*i,
                    h[3]=1000-a[1]*j;
                    
                    if((h[1]<=0)+(h[2]<=0)+(h[3]<=0)>=2){
                        ans=min(ans,i+j);if(a[2]*i+a[3]*j>=1000)break;
                        continue;
                    }
                    if(h[2]<=0||h[3]<=0){if(a[2]*i+a[3]*j>=1000)break;continue;}
                    if(h[1]>0){
                        int t1=(h[2]-1)/a[3]+1,t2=(h[3]-1)/a[2]+1;
                        if(t1==t2) ans=min(ans,i+j+t1);
                    }
                    else{
                        int t1=(h[2]-1)/a[3]+1,t2=(h[3]-1)/a[2]+1;
                        ans=min(ans,i+j+min(t1,t2));
                    }
                    if(a[2]*i+a[3]*j>=1000)break;
                }if(a[1]*i>=1000)break;
            }printf("%d\n",ans);
        }
    }return 0;
}