#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pp;
typedef pair<ll,ll> pll;
void read(int& x){ scanf("%d",&x); }
void read(ll& x){ scanf("%lld",&x); }
template<typename T,typename... Args>
void read(T& a,Args&... b){ read(a); read(b...); }
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define eb emplace_back
#define x first
#define y second

ll A, B, C;

ll Pow(ll b, ll e, ll m){
	ll ret = 1;
	while(e){
		if(e&1) ret*=b, ret%=m;
		e/=2; b=b*b%m;
	}
	return ret;
}

vector<ll> sol_prime(ll p){
	vector<ll> ret;
	for(ll x=0; x<p; ++x){
		ll v = 0;
		v += Pow(x, 3, p);
		
		v += (A%p) * Pow(x, 2, p) % p;
		v %= p;
		v += (B%p) * x % p;
		v %= p;
		v += (C%p);
		v %= p;
		if(!v) ret.pb(x);
	}
	return ret;
}

ll modinv(ll x, ll p){
	return Pow(x, p-2, p);
}

// c is capital letter
ll China(ll p1, ll r1, ll p2, ll r2){
	auto f = [](ll myp, ll op){
		ll t = modinv(op%myp, myp);
		return op * t % (myp * op);
	};
	ll M = p1*p2;
	ll ret = (r1*f(p1, p2)%M + r2*f(p2, p1)%M) % M;
	return ret;
}

vector<ll> sol;
void Test(ll x, ll mod){
	ll bound = 1e9;
	while(-bound < x-mod) x-=mod;
	for(;x<bound;x+=mod){
		if(x == 0){
			if(C == 0){
				sol.pb(x);
			}
			continue;
		}
		if(abs(C)%abs(x)) continue;
		ll d=C/x;
		if(x*x + A*x + B == -d){
			sol.pb(x);
		}
	}
}

int main()
{
	cin >> A >> B >> C;
	ll p1 = 32707;
	ll p2 = 32801;
	auto v1=sol_prime(p1);
	auto v2=sol_prime(p2);
	for(ll r1:v1) for(ll r2:v2){
		Test(China(p1, r1, p2, r2), p1*p2);
	}
	sort(all(sol));
	for(ll x:sol) cout << x << ' ';
	return 0;
}