#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second

const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
const ll MAX_N = 2e5;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    ll a, b, c;
    cin >> a >> b >> c;

    ll n;
    vector<ll> ans;
    //Answer1
    n = c/a;
    if(c%a==0 && a*n-b<=0) ans.pb(n);
    //Answer2
    n = (b+c)/a;
    if((b+c)%a==0 && 0<a*n-b) ans.pb(n);
    
    if((ll)ans.size()==0){
        cout << -1 << endl;
    }else{
        sort(all(ans));
        for(ll a : ans){
            cout << a << endl;
        }
    }
}