#include<iostream>
#include<cstdio>
#include<string>
#include<string.h>
#include<algorithm>
#include<cstdlib>
#include<ctime>
#include<cmath>
#include<iomanip>
#include<map>
#include<vector>
#include<queue>
#include<stack>
//#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int INF = 0x3f3f3f3f;
const int N = 1050;

int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int a,b,c;
        scanf("%d%d%d",&a,&b,&c);
        int sum=9999999,aa,bb;
        if(c%2)
            puts("Impossible");
        else
        {
            c/=2;
            int x=0;
            int y=9999999;
            int flag=0;
            while(1)
            {
                if(x*a>c)
                {
                    break;
                }
                if((c-x*a)%b==0)
                {
                    y=(c-x*a)/b;
                    flag=1;
                }

                if(x+y<sum)
                {
                    sum=x+y;
                    aa=x;
                    bb=y;
                }
                x++;
            }
            if(flag)
                printf("%d %d\n",aa*2,bb*2);
            else
                puts("Impossible");
        }
    }

    return 0;
}