D2

#include <bits/stdc++.h>

using namespace std;

#define cin_2d(vec, n, m) for(int i = 0; i < n; i++) for(int j = 0; j < m && cin >> vec[i][j]; j++);
#define cout_2d(vec, n, m) for(int i = 0; i < n; i++, cout << "\n") for(int j = 0; j < m && cout << vec[i][j] << " "; j++);
#define cout_map(mp) for(auto& [f, s] : mp) cout << f << "  " << s << "\n";
#define Time cerr << "Time Taken: " << (float)clock() / CLOCKS_PER_SEC << " Secs" << "\n";
#define fixed(n) fixed << setprecision(n)
#define ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
#define fill(vec, value) memset(vec, value, sizeof(vec));
#define Num_of_Digits(n) ((int)log10(n) + 1)
#define mod_combine(a, b, m) (((a % m) * (b % m)) % m)
#define all(vec) vec.begin(), vec.end()
#define rall(vec) vec.rbegin(), vec.rend()
#define sz(x) int(x.size())
#define debug(x) cout << #x << ": " << (x) << "\n";
#define fi first
#define se second
#define Pair pair < int, int >
#define ll long long
#define ull unsigned long long
#define Mod  1'000'000'007
#define OO 2'000'000'000
#define EPS 1e-9
#define PI acos(-1)

template < typename T = int > istream& operator >> (istream &in, vector < T > &v) {
    for (auto &x: v) in >> x;
    return in;
}

template < typename T = int > ostream& operator << (ostream &out, const vector < T > &v) {
    for (const T &x: v) out << x << ' ';
    return out;
}

void AhMeD_HoSSaM(){
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    freopen("tank.in", "r", stdin);
    /*#ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
    #endif*/
}

void Solve(){
    ll n, s, t;
    cin >> n >> s >> t;
    ll min_s = OO, min_t = OO, min_waste = OO;
    for(int need_s = 1; need_s <= ceil(n, s); need_s++){
        ll need_t = ceil(max(0ll, n - (need_s * s)), t);
        ll waste = (need_t * t) + (need_s * s);
        if(waste < min_waste){
            min_s = need_s;
            min_t = need_t;
            min_waste = waste;
        }
        else if(waste == min_waste){
            if(need_s + need_t <= min_s + min_t){
                min_s = need_s;
                min_t = need_t;
                min_waste = waste;
            }
        }
    }
    ll waste = ceil(n, t) * t;
    ll need_t = ceil(n, t), need_s = 0;
    if(waste < min_waste) waste = min_waste, min_s = need_s, min_t = need_t;
    if(waste == min_waste && need_s + need_t <= min_s + min_t){
        min_s = need_s;
        min_t = need_t;
        min_waste = waste;
    }
    cout << min_s << " " << min_t << "\n";
}

int main(){
    AhMeD_HoSSaM();
    int t = 1;
    cin >> t;
    while(t--)
        Solve();
    return 0;
}