#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

vector<double> quadratic_equation(double a, double b, double c) {
  if (abs(a) < EPS) {
    if (abs(b) < EPS) {
      assert(abs(c) >= EPS);
      return {};
    }
    return {-c / b};
  }
  double d = b * b - 4 * a * c;
  if (abs(d) < EPS) return {-0.5 * b / a};
  if (d <= -EPS) return {};
  d = sqrt(d);
  double x1 = -0.5 * (b >= 0 ? b + d : b - d) / a, x2 = c / (x1 * a);
  if (x1 > x2) swap(x1, x2);
  return {x1, x2};
}

int main() {
  int a, b, c; cin >> a >> b >> c;
  vector<double> ans = quadratic_equation(a, b, c);
  if (ans.size() == 2) {
    cout << ans[0] << ' ' << ans[1] << '\n';
  } else if (ans.size() == 1) {
    cout << ans[0] << '\n';
  } else {
    cout << "imaginary\n";
  }
  return 0;
}