#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>

using namespace std;

#define rep(i, l, r) for(int i=l; i<=r; i++)
#define dow(i, l, r) for(int i=l; i>=r; i--)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define clr(x, c) memset(x,c,sizeof(x))

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> Pii;

inline int read()
{
    int x=0,f=0; char ch=getchar();
    while (ch<'0' || '9'<ch) f|=ch=='-', ch=getchar();
    while ('0'<=ch && ch<='9') x=x*10+ch-'0', ch=getchar();
    return f?-x:x;
}

#define Q 1000000007

int main() {
    int T = read(); while (T--) {
        int x = read(), y = read(), z = read(), ans = 1000;
        rep(i, 0, min(999/y+1, 999/x+1)) {
            int a = max(1000 - i * y, 0);
            int b = max(1000 - i * x, 0);
            if (a == 0) {
                if (b == 0) {
                    ans = min(ans, i + 0 + 0);
                    // printf("1 %d %d %d %d\n", ans, i, 0, 0);
                } else {
                    ans = min(ans, i + 0 + min((b-1)/z+1, 999/y+1));
                    // printf("2 %d %d %d %d\n", ans, i, 0, min((b-1)/z+1, 999/y+1));
                }
            } else {
                if (b == 0) {
                    ans = min(ans, i + min((a-1)/z+1, 999/x+1) + 0);
                    // printf("3 %d %d %d %d\n", ans, i, min((a-1)/z+1, 999/x+1), 0);
                } else {
                    rep(j, 0, min((a-1)/z+1, 999/x+1)) {
                        int c = max(1000 - j * x, 0);
                        if (a - j * z > 0) {
                            if (c > 0) {
                                // b & c die
                                if ((b-1)/z+1 == (c-1)/y+1) {
                                    ans = min(ans, i + j + (b-1)/z+1);
                                    // printf("4 %d %d %d %d\n", ans, i, j, (b-1)/z+1);
                                }
                            }
                        } else if (c > 0) {
                            // a & (b or c) die
                            ans = min(ans, i + j + min((b-1)/z+1, (c-1)/y+1));
                            // printf("5 %d %d %d %d\n", ans, i, j, min((b-1)/z+1, (c-1)/y+1));
                        } else if (c == 0) {
                            ans = min(ans, i + j + 0);
                            // printf("6 %d %d %d %d\n", ans, i, j, 0);
                        }
                    }
                }
            }
        }
        printf("%d\n", ans);
    }
}