#include<iostream>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;

int gcd(int a, int b)
{
    int c;
    while(b)
    {
        c = a % b;
        a = b;
        b = c;
    }
    return a;
}

bool cmp(int a, int b, int num_a, int num_b)
{
    int mid = (a * num_a + b* num_b) / 2;
    for(int i = 0 ; i <= num_a ; i++)
        if((mid - i * a)%b == 0)
            return true;
    return false;
}

int main()
{
    int T, a, b, c, temp;
    int i, j, p, q, num_a, num_b;
    while(~scanf("%d", &T))
    {
        while(T--)
        {
            scanf("%d %d %d", &a, &b, &c);
            p = a < b ? a : b;
            q = a > b ? a : b;
            temp = gcd(a,b);
            if(c%temp != 0 || c%2 != 0)
            {
                cout<<"Impossible"<<endl;
                continue;
            }
            else 
            {
                for(i = 0; i * p <= c; i++)
                {
                    if((c - i * p) % q == 0)
                    {
                        j = (c - i * p) / q;
                        if(cmp(p,q,i,j))
                        {
                        if(p == a)
                            printf("%d %d\n", i, j);
                        else 
                            printf("%d %d\n", j, i);
                        break;
                        }
                    }
                }
                if(i * p > c)
                    cout<<"Impossible"<<endl;
            }
        }
    }
    return 0;
}