#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int A,B,C;
  cin>>A>>B>>C;

  int D=B*B-4*A*C;
  if(D<0){
    cout<<"imaginary"<<endl;
    return 0;
  }

  vector<long double> ans;
  if(D==0) ans.push_back(-B/(long double)(2*A));
  else{
    ans.push_back((-B-sqrt(D))/(long double)(2*A));
    ans.push_back((-B+sqrt(D))/(long double)(2*A));
  }

  sort(all(ans));
  for(auto d:ans) cout<<fixed<<setprecision(15)<<d<<" ";
  cout<<endl;

  return 0;
}