#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int a,b,c; cin >> a >> b >> c;
    vector<int> v = {c+b};
    if(c <= b) v.push_back(c);
    vector<int> res;
    for (int i = 0; i < v.size(); ++i) {
        if(v[i]%a == 0) res.push_back(v[i]/a);
    }
    sort(res.begin(), res.end());
    if(res.size() == 0) res.push_back(-1);
    for (int i = 0; i < res.size(); ++i) {
        cout << res[i] << endl;
    }
}