#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
vector<long long int> v;
vector<long long int> w, ab, bc;
set<long long int> uo;
map<long long int, long long int> ww, cc, u;
vector<pair<long long int, long long int> > uu, su;
map<long long int, vector<long long int> > uuu;
map<pair<long long int, long long int>, long long int> vo;
map<pair<long long int, long long int>, long long int> vu;
map<long long int, pair<long long int, pair<long long int, long long int> > >
    vs;
long long int dx[] = {-1, 0, 1, 0, 1, 1, -1, -1};
long long int dy[] = {0, 1, 0, -1, -1, 1, 1, -1};
long long int dxx[] = {2, 1, -1, -2, -2, -1, 1, 2};
long long int dyy[] = {1, 2, 2, 1, -1, -2, -2, -1};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  char ch;
  string a, b, c;
  double x, y, d, e, f, g, h;
  long long int n, i, j, k, p, q, o, l, s, tt = 1, m, t, z, aa, r = 0;
  cin >> tt;
  for (long long int mau = 1; mau <= tt; mau++) {
    v.clear();
    w.clear();
    ww.clear();
    uu.clear();
    uo.clear();
    vo.clear();
    vu.clear();
    ab.clear();
    bc.clear();
    cc.clear();
    uuu.clear();
    a.clear();
    b.clear();
    c.clear();
    u.clear();
    cin >> n >> p >> q;
    if (p >= q || n <= p) {
      cout << n << "\n";
    } else {
      m = n / 2;
      if (n % 2 == 1) {
        m++;
      }
      if (p >= m) {
        cout << n << "\n";
        continue;
      }
      t = n - m;
      r = m / p;
      if (m % p != 0) {
        aa = (p * r);
        aa += (q * r);
        aa += m % p;
      } else {
        aa = (p * r) + (q * (r - 1));
      }
      cout << max(aa, n) << "\n";
    }
  }
  return 0;
}
