//Δ_1007
#include<iostream>
#include<cstdio>
#include<fstream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<bitset>
#include<cmath>
#include<cstring>
#include<cstdlib>
using namespace std;
typedef long long LL;
typedef double DB;
const int inf = 1e6;
void cmin(int&x,int y){
    if(x>y)
        x=y;
}
int h=1000,x,y,z;
int go(int&a,int&b,int x,int y){
    if(b<=0)
        return 0;
    int o=(b-1)/x+1;
    if(a<=(o-1)*y)
        return inf;
    a-=o*y,b-=o*x;
    return o;
}
int solve1(int a,int b,int c){
    return go(c,a,z,x)+go(c,b,z,y);
}
int solve2(int a,int b,int c){
    return go(c,a,z,x)+go(b,c,y,z);
}
int solve3(int a,int b,int c){
    return go(c,b,z,y)+go(a,c,x,z);
}
int main()
{
    int T,a,b,c,o,ans;
    scanf("%d",&T);
    while(T--){
        scanf("%d%d%d",&x,&y,&z);
        a=h,b=h,c=h,o=0;
        ans=inf;
        while(1){
            cmin(ans,o+solve1(a,b,c));
            cmin(ans,o+solve2(a,b,c));
            cmin(ans,o+solve3(a,b,c));
            if(a<=0||b<=0)
                break;
            a-=y,b-=x;
            o++;
        }
        printf("%d\n",ans);
    }
    return 0;
}