#include <bits/stdc++.h>

using namespace std;

using ll = long long;

bool euclid(int n, int m, int a, int b) {
  if (n == m) return 0;
  if (a > b) swap(n, m), swap(a, b);
  if (m < a) return 1;
  int k = m / a;
  return euclid(m - k * a, n, b - k * a, a);
}

void solve() {
  ll n; int a, b;
  scanf("%lld%d%d", &n, &a, &b);
  ll lcm = (ll)a / __gcd(a, b) * b;
  ll ans = (lcm - lcm / a - lcm / b + 2) * (n / lcm); n %= lcm;
  if (n < a && n < b) ans += n;
  else ans += n - n / a - n / b + 1 + euclid(n % a, n % b, a, b);
  printf("%lld\n", ans);
}

int T;

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