#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=(ll)1e9+7;
const ll INF=(ll)1e18+10;
const double PI=acos(-1);

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
int dy[]={-1,1,0,0};
int dx[]={0,0,-1,1};

void solve(int cn) {
    int a,b,c;
    cin>>a>>b>>c;

    int D;
    double ans1,ans2;
    D = b*b - 4*a*c;
    if(D>0){
        ans1 = (-1.0*b-sqrt(1.0*b*b-4.0*a*c))/(2.0*a);
        ans2 = (-1.0*b+sqrt(1.0*b*b-4.0*a*c))/(2.0*a);
        printf("%.10lf %.10lf\n",ans1,ans2);
    }else if(D==0){
        ans1 = -1.0*b/(2.0*a);
        printf("%.10lf\n",ans1);
    }else{
        cout<<"imaginary"<<endl;
    }

}


#define SINGLE
int main() {
#ifdef SINGLE
    solve(1);
#else
    int N;
    cin>>N;
    for(int i=0;i<N;++i){
        solve(i);
    }
#endif
    return 0;
}