#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
#include <limits>
#include <array>

static const int MOD = 998244353;
using ll = long long;
using uint = unsigned;
using ull = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    ll a, b, c;
    cin >> a >> b >> c;
    int cnt = 0;
    for (int i = 1; i <= b+c; ++i) {
        ll val = a*i;
        if(val > b) val -= b;
        if(val == c) {
            cout << i << "\n";
            cnt++;
        }
    }
    if(cnt == 0) {
        cout << -1 << "\n";
    }
    return 0;
}