//#include <atcoder/all>
#include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
using namespace std;
//using namespace atcoder;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<pair<ll, ll>>>;
ll N,B,K;
ll mod=1e9+7;
vll C;

char tr(char C){
    if(C>'a'){
        return (C-'a'+'A');
    }
   else{
       return (C-'A'+'a');
   }
}

int main(){
   ll A,B,C;
   cin>>A>>B>>C;
   if(A<0){
       A*=-1;
       B*=-1;
       C*=-1;
       
   }
   ll D=B*B-4*A*C;
   if(D<0){
       cout<<"imaginary"<<endl;
       return 0;
   }
   else{
       if(D==0){
           cout<<double(-1*B/double(2*A))<<endl;
       }
       else{
           cout<<setprecision(16)<<((-1*B-sqrt(D))/double(2*A))<<" "<<((-1*B+sqrt(D))/double(2*A))
  <<endl;     }
   }
}