#include <bits/stdc++.h>
#include <chrono>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;

ll N,M,H,W,Q,K,A,B;
string S;
typedef pair<ll, ll> P;
const ll INF = (1LL<<58);
int main() {
    vec a(3);
    rep(i,3) cin>>a[i];
    ll sq = a[1] * a[1] - a[0] * a[2] * 4.0;
    if(sq < 0) {
        cout<<"imaginary"<<endl;
    }else if(sq == 0){
        cout<<fixed<<setprecision(15)<<(-(long double)a[1]) / ((long double) a[0] * 2.0)<<endl;
    }else{
        long double ans1 = (-(long double)a[1] + sqrt((double)sq)) / ((long double) a[0] * 2.0);
        long double ans2 = (-(long double)a[1] - sqrt((double)sq)) / ((long double) a[0] * 2.0);
        if(ans1 > ans2) swap(ans1, ans2);
        cout<<fixed<<setprecision(15)<<ans1<<' '<<ans2<<endl;
    }
}