#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 10;
const long long int LINF = 1LL * INF * INF;
const int MAXN = 2e5 + 10;
const int MAXM = 5e3 + 10;
priority_queue<int> pq;
vector<vector<int> > graph;
queue<int> que;
int A[MAXN];
char S[MAXN];
bool dp[MAXM];
int main() {
  int n, m, k, a, b, c, x, y;
  int sum = 0;
  int cnt = 0;
  int mx = 0;
  int mn = INF;
  int cur = 0, idx = -1;
  cin >> a >> b >> c;
  dp[0] = true;
  for (int i = min(a, b); i <= c; i++) {
    if (i >= a) dp[i] |= dp[i - a];
    if (i >= b) dp[i] |= dp[i - b];
  }
  if (dp[c])
    cout << "Yes\n";
  else
    cout << "No\n";
  return 0;
}
