#include "bits/stdc++.h"
#include <random>
using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef pair<lint, lint> plint; typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(lint i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define endk '\n'
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 (b < a) { a = b; return 1; } return 0; }
const lint MOD = 1e9 + 7, INF = 1e18;
lint dx[8] = { 0, -1, 1, 0, 1, -1, 1, -1 }, dy[8] = { 1, 0, 0, -1, -1, -1, 1, 1 };

long double A, B, C;
int main() {
	cin >> A >> B >> C;
	if (B * B < 4 * A * C) cout << "imaginary" << endk;
	else if(B *B != 4 * A * C){
		vector<long double> ans;
		ans.push_back((-B - sqrt(B * B - 4 * A * C)) / 2 * A);
		ans.push_back((-B + sqrt(B * B - 4 * A * C)) / 2 * A);
		sort(ALL(ans));
		cout << setprecision(30) << ans[0] << " " << ans[1] << endk;
	}
	else {
		cout << setprecision(30) << -B  / 2 * A << endk;
	}
}