#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<algorithm>
#include<vector>
#include<math.h>
#include<iomanip>
#include<stack>
#include<queue>
#include<set>
#include<map>
 
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
 
//const ll mod = 1000000007;
const ll mod = 998244353;
const ld pi = 3.14159265358979;

ll gcd(ll a , ll b){
	if(a < b)swap(a , b);
	if(b == 0)return 1;
	if(a % b == 0)return b;
	else return gcd(b , a % b);
}

int main(){	
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout << fixed << setprecision(20);
	ld a , b , c;
	cin >> a >> b >> c;
	ld y = 2 * a;
	ld x = b * -1;
	ld d = b * b - 4 * a * c;

	if(d < 0){
		cout << "imaginary" << endl;
		exit(0);
	}
	ld ans1 = (x + sqrt(d))/y;
	if(d == 0){
		cout << ans1 << endl;
		exit(0);
	}
	ld ans2 = (x - sqrt(d))/y;
	if(ans1 > ans2)swap(ans1 , ans2);
	cout << ans1 << " " << ans2 << endl;
	return 0;
}