#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {

  long double a, b, c;
  cin >> a >> b >> c;
  long double d = b * b - 4.0 * a * c;
  if(d < 0) {
    cout << "imaginary\n";
    return 0;
  } else if(d == 0) {
    printf("%.12Lf\n", -b / (a * 2.0));
    return 0;
  }
  long double e = sqrt((long double)d);
  long double x1 = (-b - e) / (2.0 * a);
  long double x2 = (-b + e) / (2.0 * a);
  if(x1 > x2) {
    swap(x1, x2);
  }
  printf("%.12Lf %.12Lf\n", x1, x2);
  return 0;
}