#include using namespace std; typedef long long ll; typedef vector vi; typedef vector vvi; #define rep(i,n) for(ll i=0;i<(n);i++) #define pii pair #define piii pair #define mp make_pair #define pb push_back #define ALL(a) (a).begin(),(a).end() #define FST first #define SEC second const int INF = (INT_MAX/2); const ll LLINF = (LLONG_MAX/2); const double eps = 1e-5; const double PI = M_PI; #define DEB cout<<"!"< Array; typedef vector matrix; vector v; void check_c(ll c){ if(c < 0) c *= -1; for(ll i = 1; i*i <= c; i++) if(i != 0 && c%i == 0){ v.pb(i); v.pb(-i); v.pb(c/i); v.pb(-c/i); } } int main(){ ll a,b,c; cin >> a >> b >> c; if(c == 0){ for(ll x = 1;;){ if(b%x == 0 && x + a + b/x == 0){ cout << - x << " " << 0 <<" "<< x << endl; return 0; } } } check_c(c); sort(ALL(v)); for(int i = 0; i < v.size();i++){ ll x = v[i]; for(int j = i+1; j < v.size(); j++){ ll y = v[j]; ll z = -a - x - y; if(c%z == 0 && x+y+z == -a && x*y+y*z+z*x == b && x*y == -c/z){ cout << x << " " << y << " " << z <