#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
const long long mod = 1e9 + 7;
inline long long read() {
  long long X = 0;
  bool flag = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') flag = 0;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    X = (X << 1) + (X << 3) + ch - '0';
    ch = getchar();
  }
  if (flag) return X;
  return ~(X - 1);
}
long long n, m, k;
long long ar[N], br[N];
long long ans;
long long gcd(long long a, long long b) {
  while (b ^= a ^= b ^= a %= b)
    ;
  return a;
}
int main() {
  int T;
  T = read();
  while (T--) {
    m = read();
    long long d = read();
    long long w = read();
    if ((d - 1) % w == 0) {
      long long k = min(m, d);
      ans = k * (k - 1) / 2;
      cout << ans << endl;
      continue;
    } else {
      long long lcm = (d - 1) * w / gcd(d - 1, w);
      long long c = lcm / (d - 1);
      long long mi = min(m, d);
      long long k = mi / c;
      ans = k * mi - (c + k * c) * k / 2;
    }
    cout << ans << endl;
  }
  return 0;
}
