#include <bits/stdc++.h>
using namespace std;
int egcd(int a, int b, int& x, int& y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  int x1, y1;
  int g = egcd(b, a % b, x1, y1);
  x = y1;
  y = x1 - (a / b) * y1;
  return g;
}
bool find_sol(int a, int b, int c, int& g, int& x, int& y) {
  g = egcd(a, b, x, y);
  if (c % g) return false;
  x *= c / g;
  y *= c / g;
  return true;
}
void shift_sol(int a, int b, int& x, int& y, int k) {
  x += k * b;
  y -= k * a;
}
int main() {
  int a, b, c, x, y, g;
  cin >> a >> b >> c;
  if (!find_sol(a, b, c, g, x, y)) {
    cout << "No" << endl;
    return 0;
  }
  a /= g;
  b /= g;
  if (x >= 0 && y >= 0) {
    cout << "Yes" << endl;
    return 0;
  }
  if (x < 0 && y < 0) {
    cout << "No" << endl;
    return 0;
  }
  if (y < x) {
    swap(y, x);
    swap(a, b);
  }
  shift_sol(a, b, x, y, (-x) / b);
  if (x < 0) shift_sol(a, b, x, y, 1);
  if (y >= 0) {
    cout << "Yes" << endl;
    return 0;
  } else {
    cout << "NO" << endl;
    return 0;
  }
}
