#include <stdio.h>
#include <algorithm>

int a[3];

int upper_div(int a,int b){
    return (a+b-1)/b;
}

void solve(){
    scanf("%d%d%d",&a[0],&a[1],&a[2]);
    std::sort(a,a+3);
    int ans=0x7fffffff;
    int lim1=upper_div(1000,a[1]);
    for(int bt1=0;bt1<=lim1;bt1++){//1,2
        int hp2 = 1000-a[0]*bt1;
        int hp1t = 1000-a[1]*bt1;
        int lim2=upper_div(hp1t,a[2]);
        for(int bt2=0;bt2<=lim2;bt2++){//1,3
            int hp1 = hp1t-a[2]*bt2;
            int hp3 = 1000-a[0]*bt2;
            int bt31 = upper_div(hp2,a[2]);
            int bt32 = upper_div(hp3,a[1]);
            if(hp1<=0){
                int bt3 = std::min(bt31,bt32);
                ans = std::min(ans,bt1+bt2+bt3);
            }else{
                if(bt31!=bt32) continue;
                ans = std::min(ans,bt1+bt2+bt31);
            }
        }
    }
    printf("%d\n",ans);
}

int main(){
    int T; scanf("%d",&T);
    while(T--) solve();
}