#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const ld EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

int main(){
    int a, b, c;
    cin >> a >> b >> c;
    if(a < 0) a *= -1, b *= -1, c *= -1;
    ld p, q, r;
    p = a, q = b, r = c;
    int d = b*b-4*a*c;
    if(d < 0) cout << "imaginary" << endl;
    elif(d == 0) cout << sp(10) << -q/(2.0*p) << endl;
    else{
        ld D = sqrt(d);
        cout << sp(10) << (-q-D)/(2.0*p) << ' ' << (-q+D)/(2.0*p) << endl;
    }
}