#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()

typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;

double a, b, c;
VI ans;

double f(double x){
    return x*x*x + a*x*x + b*x + c;
}

void calc(double l, double r){
    double ll = l, rr = r;
    if (f(l)*f(r) > 0) return;
    REP(_,100){
        double m = (l+r)/2;
        if (f(m) * f(r) > 0) r = m;
        else l = m;
    }

    ans.push_back(round(l));
    calc(ll, l-0.5);
    calc(l+0.5, rr);
}

int main(){
    cin >> a >> b >> c;

    calc(-1e18, 1e18);
    sort(ALL(ans));
    REP(i,ans.size()){
        cout << ans[i] << " ";
    }
    cout << endl;

    return 0;
}