#include <bits/stdc++.h>

using i64 = long long;

i64 f(i64 a, i64 b, i64 l, i64 r) {
    if (l == 0) {
        return 0;
    }
    if (a == 0) {
        return -1;
    }
    i64 v = (l + a - 1) / a;
    if (v * a <= r) {
        return v;
    }
    v = f(b, a % b, a - r % a, a - l % a);
    if (v == -1) {
        return -1;
    }
    return (v * b + l + a - 1) / a;
}

bool get1(i64 a, i64 x, i64 n, i64 b, i64 y) {
    if (x >= n) {
        return false;
    }
    if (y == 0) {
        return true;
    }
    std::cerr << a << " " << x << " " << n << " " << b << " " << y << "\n";
    i64 l = (y - x % b + b) % b;
    i64 r = (-x % b + b) % b;
    i64 k = (n - 1 - x) / a;
    if (l < r) {
        i64 v = f(a, b, l, r - 1);
        if (v != -1 && v <= k) {
            return true;
        }
    } else {
        if (l < b) {
            i64 v = f(a, b, l, b - 1);
            if (v != -1 && v <= k) {
                return true;
            }
        }
        if (r > 0) {
            i64 v = f(a, b, 0, r - 1);
            if (v != -1 && v <= k) {
                return true;
            }
        }
    }
    return false;
}

i64 get(i64 n, int a, int b) {
    int g = std::gcd(a, b);
    if (g != 1) {
        return get(n / g, a / g, b / g);
    }
    i64 res = n / a + n / b - 2 * (n / a / b);
    i64 na = n % a;
    i64 nb = n % b;
    i64 nab = n % (1LL * a * b);
    if (na < nab || nb < nab) {
        res--;
    }
    if (get1(a, na, nab, b, nb)
        || get1(b, nb, nab, a, na)) {
        res--;
    }
    return res;
}

int t = 0;
int ok = 0;

void solve() {
    i64 n;
    int a, b;
    std::cin >> n >> a >> b;
    t++;

    i64 bad = get(n, a, b);

    if (t == 2799) {
        std::cout << n << " " << a << " " << b << "\n";
        std::exit(0);
    }
    if (ok) std::cout << n - bad << "\n";
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int t;
    std::cin >> t;

    if (t < 2000) {
        ok = 1;
    }

    while (t--) {
        solve();
    }    

    return 0;
}