#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <time.h>
#include <numeric>
#include <random>
#include <unordered_map>
#include <unordered_set>
#define all(a) a.begin(),a.end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pb push_back
#define debug(x) cerr << __LINE__ << ' ' << #x << ':' << x << '\n'
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef complex<ld> com;
constexpr int inf = 1000000010;
constexpr ll INF = 1000000000000000010;
constexpr ld eps = 1e-12;
constexpr ld pi = 3.141592653589793238;
template<class T, class U> inline bool chmax(T &a, const U &b) { if (a < b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmin(T &a, const U &b) { if (a > b) { a = b; return true; } return false; }


int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout << fixed << setprecision(20);

	int a, b, c;
	cin >> a >> b >> c;
	ld x, y, z;
	x = a, y = b, z = c;
	if (b * b - 4 * a * c < 0) {
		cout << "imaginary\n";
		return 0;
	}
	else if (b * b - 4 * a * c == 0) {
		cout << -y / 2 / x << '\n';
	}
	else {
		ld d = y / 2 / x;
		ld large = -1e9, small = d;
		rep(_, 10000) {
			ld mid = (large + small) / 2;
			ld val = x * mid * mid + y * mid + z;
			if (val > 0) large = mid;
			else small = mid;
		}
		cout << large << ' ';
		large = 1e9, small = d;
		rep(_, 10000) {
			ld mid = (large + small) / 2;
			ld val = x * mid * mid + y * mid + z;
			if (val > 0) large = mid;
			else small = mid;
		}
		cout << large << '\n';
	}
}