#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <deque>
#include <cmath>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
using ll = long long;
using ld = long double;

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

    vector<int> res;
    for(int n = 1; n <= 100000; n++){
        if(n*a-b > 0 && n*a-b == c) res.emplace_back(n);
        else if(n*a-b <= 0 && n*a == c) res.emplace_back(n);
    }
    if(res.size() == 0) cout << -1 << endl;
    else{
        for(int i = 0; i < res.size(); i++) cout << res[i] << '\n';
    }
    return 0;
}