#include <bits/stdc++.h>
using namespace std;
#define overload2(a, b, c, ...) c
#define overload3(a, b, c, d, ...) d
#define overload4(a, b, c, d, e ...) e
#define overload5(a, b, c, d, e, f ...) f
#define overload6(a, b, c, d, e, f, g ...) g
#define fast_io ios::sync_with_stdio(false); cin.tie(nullptr);
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
typedef long long ll;
typedef long double ld;
#define chmin(a,b) a = min(a,b);
#define chmax(a,b) a = max(a,b);
#define bit_count(x) __builtin_popcountll(x)
#define leading_zero_count(x) __builtin_clz(x)
#define trailing_zero_count(x) __builtin_ctz(x)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) a / gcd(a,b) * b
#define rep(...) overload3(__VA_ARGS__, rrep, rep1)(__VA_ARGS__)
#define rep1(i,n) for(int i = 0 ; i < n ; i++)
#define rrep(i,a,b) for(int i = a ; i < b ; i++)
#define repi(it,S) for(auto it = S.begin() ; it != S.end() ; it++)
#define pt(a) cout << a << endl;
#define print(...) printall(__VA_ARGS__);
#define debug(a) cout << #a << " " << a << endl;
#define all(a) a.begin(), a.end()
#define endl "\n";
#define v1(T,n,a) vector<T>(n,a)
#define v2(T,n,m,a) vector<vector<T>>(n,v1(T,m,a))
#define v3(T,n,m,k,a) vector<vector<vector<T>>>(n,v2(T,m,k,a))
#define v4(T,n,m,k,l,a) vector<vector<vector<vector<T>>>>(n,v3(T,m,k,l,a))
template<typename T,typename U>istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}
template<typename T,typename U>ostream &operator<<(ostream&os,const pair<T,U>&p){os<<p.first<<" "<<p.second;return os;}
template<typename T>istream &operator>>(istream&is,vector<T>&v){for(T &in:v){is>>in;}return is;}
template<typename T>ostream &operator<<(ostream&os,const vector<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}
template<typename T>istream &operator>>(istream&is,vector<vector<T>>&v){for(T &in:v){is>>in;}return is;}
template<typename T>ostream &operator<<(ostream&os,const vector<vector<T>>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?"\n":"");}return os;}
template<typename T>ostream &operator<<(ostream&os,const set<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}
template<typename T>ostream &operator<<(ostream&os,const multiset<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}
template<class... Args> void printall(Args... args){for(auto i:initializer_list<common_type_t<Args...>>{args...}) cout<<i<<" ";cout<<endl;}

const int mod = 998244353 ;

template< int mod >
struct ModInt {
    int x;

    ModInt() : x(0) {}

    ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    ModInt &operator+=(const ModInt &p) {
        if((x += p.x) >= mod) x -= mod;
        return *this;
    }

    ModInt &operator-=(const ModInt &p) {
        if((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }

    ModInt &operator*=(const ModInt &p) {
        x = (int) (1LL * x * p.x % mod);
        return *this;
    }

    ModInt &operator/=(const ModInt &p) {
        *this *= p.inverse();
        return *this;
    }

    ModInt operator-() const { return ModInt(-x); }

    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }

    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }

    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }

    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }

    bool operator==(const ModInt &p) const { return x == p.x; }

    bool operator!=(const ModInt &p) const { return x != p.x; }

    ModInt inverse() const {
        int a = x, b = mod, u = 1, v = 0, t;
        while(b > 0) {
            t = a / b;
            swap(a -= t * b, b);
            swap(u -= t * v, v);
        }
        return ModInt(u);
    }

    ModInt pow(int64_t n) const {
        ModInt ret(1), mul(x);
        while(n > 0) {
            if(n & 1) ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        return ret;
    }

    friend ostream &operator<<(ostream &os, const ModInt &p) {
        return os << p.x;
    }

    friend istream &operator>>(istream &is, ModInt &a) {
        int64_t t;
        is >> t;
        a = ModInt< mod >(t);
        return (is);
    }

    static int get_mod() { return mod; }
};

using modint = ModInt< mod >;

struct Int128t {
    private:
        __int128_t v;

    public:
        Int128t() {}
        Int128t(const long long &a) { v = a; }
        Int128t(const string &s) { parse(s); }

        long long long_val() { return (long long)v; }
        __int128_t val() { return v; }
        __int128_t abs() { return v < 0 ? -v : v; }

        void set(const long long &a) { v = a; }

        void parse(const string &s) {
            v = 0;
            for ( char c : s ) {
            if ( isdigit(c) ) v = v * 10 + (c - '0');
            }
            if ( s[0] == '-' ) v *= -1;
        }

        Int128t operator+=(const Int128t &a) {
            v += a.v;
            return *this;
        }
        Int128t operator-=(const Int128t &a) {
            v -= a.v;
            return *this;
        }
        Int128t operator*=(const Int128t &a) {
            v *= a.v;
            return *this;
        }
        Int128t operator/=(const Int128t &a) {
            v /= a.v;
            return *this;
        }
        Int128t operator%=(const Int128t &a) {
            v %= a.v;
            return *this;
        }

        Int128t& operator++() {
            ++v;
            return *this;
        }

        Int128t operator++(int) {
            Int128t tmp(*this);
            ++v;
            return tmp;
        }

        Int128t& operator--() {
            --v;
            return *this;
        }

        Int128t operator--(int) {
            Int128t tmp(*this);
            --v;
            return tmp;
        }

        Int128t operator-() const { return Int128t(-v); }

        Int128t operator+(const Int128t &p) const { return Int128t(*this) += p; }

        Int128t operator-(const Int128t &p) const { return Int128t(*this) -= p; }

        Int128t operator*(const Int128t &p) const { return Int128t(*this) *= p; }

        Int128t operator/(const Int128t &p) const { return Int128t(*this) /= p; }

        Int128t operator%(const Int128t &p) const { return Int128t(*this) %= p; }

        bool operator<(const Int128t &a) const { return v < a.v; }

        bool operator>(const Int128t &a) const { return v > a.v; }

        bool operator<=(const Int128t &a) const { return v <= a.v; }

        bool operator>=(const Int128t &a) const { return v >= a.v; }

        bool operator==(const Int128t &a) const { return v == a.v; }

        bool operator!=(const Int128t &a) const { return v != a.v; }

        Int128t operator<<(const Int128t &a) const {
            return Int128t(v << a.v);
        }

        Int128t operator>>(const Int128t &a) const {
            return Int128t(v >> a.v);
        }

        Int128t& operator<<=(const Int128t &a) {
            v <<= a.v;
            return *this;
        }

        Int128t& operator>>=(const Int128t &a) {
            v >>= a.v;
            return *this;
        }
        
        friend istream &operator>>(istream &is, Int128t &v) {
            string s;
            is >> s;
            v.parse(s);
            return is;
        }

        friend ostream &operator<<(ostream &os, const Int128t &v) {
            if ( !ostream::sentry(os) ) return os;
            char buf[64];
            char *d = end(buf);
            __uint128_t tmp = (v.v < 0 ? -v.v : v.v);

            do {
                d--;
                *d = char(tmp % 10 + '0');
                tmp /= 10;
            } while ( tmp );
            if ( v.v < 0 ) {
                d--;
                *d = '-';
            }
            int len = end(buf) - d;
            if ( os.rdbuf()->sputn(d, len) != len ) { os.setstate(ios_base::badbit); }
            return os;
        }
};

using int128t = Int128t;

void solve(){
    int128t x, a, b;
    cin >> x >> a >> b;
    if(x % a == 0 && x % b == 0){
        pt(1)
        return;
    }
    if(a == b){
        pt(2)
        return;
    }
    if(a > b) swap(a,b);
    int128t g = gcd(a,b);
    int128t l = lcm(a,b);
    x %= l;
    int128t ax = a / g;
    int128t bx = b / g;
    int128t res = 1;
    res += ax * 2;
    res -= x / b * 2;
    if(x % b == 0) res -= 2;
    if(x % a == 0) res -= 1;
    res %= 998244353;
    pt(res)
}

int main(){
    fast_io
    int t = 1;
    cin >> t;
    rep(i,t) solve();
}