#include <iostream>
#include <queue>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <cstring>
#define inf 9999999
#define mo 1000000007
#define LL long long 
using namespace std;
const int maxn=10000;
int x[maxn],y[maxn],n[maxn];
int main()
{
    int t,a,b,c,ans; 
    cin>>t;
    while(t--)
    {
        cin>>a>>b>>c;
        if (c%2!=0) {cout<<"Impossible"<<endl;continue;}
        c/=2;
        memset(x,0,sizeof(x));
        memset(y,0,sizeof(y));
        memset(n,0,sizeof(n));
        x[a]=1;y[b]=1;
        n[a]=1;n[b]=1;
        for (int i=1;i<=c;i++)
        {
            if (n[i])
            {
                if (!n[i+a])
                {
                    n[i+a]=n[i]+1;
                    x[i+a]=x[i]+1;
                    y[i+a]=y[i];
                }
                else if (n[i+a]>n[i]+1)
                {
                    n[i+a]=n[i]+1;
                    x[i+a]=x[i]+1;
                    y[i+a]=y[i];
                }

                if (!n[i+b])
                {
                    n[i+b]=n[i]+1;
                    x[i+b]=x[i];
                    y[i+b]=y[i]+1;
                }
                else if (n[i+b]>n[i]+1)
                {
                    n[i+b]=n[i]+1;
                    x[i+b]=x[i];
                    y[i+b]=y[i]+1;
                }
            }
        }
        if (n[c]==0) {cout<<"Impossible"<<endl;}
        else cout<<x[c]*2<<" "<<y[c]*2<<endl;
    }    
}