#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;

int cal(int h, int x) {
    if (h % x == 0) return h / x;
    return h / x + 1;
}

int solve(int x, int y, int z) {
    int ans = 1e9;
    if (cal(1000, x) == cal(1000, y)) ans = cal(1000, x);
    else {
        int t = min(cal(1000, x), cal(1000, y));
        if (1000 - t * x > 0) ans = min(ans, t + min(cal(1000 - t * x, z), cal(1000, y)));
        else ans = min(ans, t + min(cal(1000 - t * y, z), cal(1000, x)));
    }
    for (int i = 0; i * x < 1000 && i * y < 1000; i++) {
        int h1 = 1000 - y * i, h2 = 1000 - x * i;
        if ((cal(h1, z) * x + (cal(h2, z) - 1) * y) < 1000 || 
            ((cal(h1, z) - 1) * x + cal(h2, z) * y) < 1000)
            ans = min(ans, i + cal(h1, z) + cal(h2, z));
    }
    return ans;
}

int main() {
    int T, x, y, z;
    scanf("%d", &T);
    while (T--) {
        scanf("%d%d%d", &x, &y, &z);
        int ans = 1e9;
        ans = min(ans, solve(x, y, z));
        ans = min(ans, solve(x, z, y));
        ans = min(ans, solve(y, z, x));
        printf("%d\n", ans);
    }
    return 0;
}