#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
typedef long long ll;
ll ans[3];
double a,b,c;
double f(double x) {
  double ret = x;
  ret += a;
  ret *= x;
  ret += b;
  ret *= x;
  ret += c;
  return ret;
}
int main()
{
  cin >> a >> b >> c;
  for(double x = -1000006; x < 1000006; x+=1.0) {
    if(f(x)==0) {
      ans[0] = (ll)x;
      break;
    }
  }
  long double aa = a + ans[0];
  long double bb = ans[0] * ans[0] + ans[0] * a + b;
  long double D = aa * aa - 4 * bb;
  long double x1 = (- aa - sqrt(D))/2;
  long double x2 = (- aa + sqrt(D))/2;
  ans[1] = ll(round(x1));
  ans[2] = ll(round(x2));
  sort(ans, ans + 3);
  printf("%lld %lld %lld\n",ans[0],ans[1],ans[2]);
  return 0;
}