//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using ll = int64_t;
using ull = uint64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T>>;
const int INF = 0xccccccc;
const ll LINF = 0xcccccccccccccccLL;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}

char str[] = "UNSATISFIABLE";

//head



int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int a, b, w;
  cin >> a >> b >> w;
  w *= 1000;
  int l = 0, r = 0;
  int cnt = 0;
  int mi = INF, ma = 0;
  while(l <= w) {
    if(w <= r) {
      chmin(mi, cnt);
      chmax(ma, cnt);
    }
    l += a;
    r += b;
    cnt++;
  }
  if(mi == INF) puts(str);
  else cout << P(mi, ma) << endl;
}
#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
int main(){
  long long A,B,C,D;
  cin>>A>>B>>C>>D;
  long long sum=A+B+C+D;
  if(A==sum-A||B==sum-B||C==sum-C||D==sum-D||A+B==C+D||A+C==B+D||A+D==B+C){
    cout<<"Yes"<<endl;
  }
  else cout<<"No"<<endl;
  
  
  return 0;
}