#include <iostream>
int main(){
    int A, B, W, Wg;
    int min=1000001, max=0;
    std::cin >> A >> B >> W;
    Wg = W * 1000;
    for (int i = 1; i <= 1000000; i++) {
        if ((A * i <= Wg) && (B * i >= Wg)) {
            if (i < min) min = i;
            if (i > max) max = i;
        }
    }
    if (min == 2001 || max == 0) {
        std::cout << "UNSATISFIABLE" << std::endl;
    } else {
        std::cout << min << " " << max << std::endl;
    } 
}
/* 
As fire is shrouded in smoke, a mirror by dust and a child by the womb,
      so is the universe enveloped in desire.

It is the wise man’s constant enemy; it tarnishes the face of wisdom.
        It is as insatiable as a flame of fire.

It works through the senses, the mind and the reason;
         and with their help destroys wisdom and confounds the soul.

Therefore, O Arjuna, first control thy senses and then slay desire,
            for it is full of sin, and is
                the destroyer of knowledge and of wisdom.
                                                  
                                                  -- "SHRI BHAGVAT GITA"
 */
#include <bits/stdc++.h>
using namespace std; 
typedef long long int ll;
#define pb push_back 
#define popb pop_back
#define mp make_pair
#define ve vector
#define vii vector < int >
#define vll vector < ll > 
#define pii pair < int , int >
#define pll pair < ll , ll >
#define vpl vector < pll >
#define fi first
#define sz size 
#define len length 
#define se second 
//const ll mod=998244353;
const ll mod = 100000000000000000+7;
const ll N=10000000+6;
#define M_PI           3.14159265358979323846
//-------------

void ps(string st)
{
    int n = st.size();
    int z = 0 , d = 0;
    for(char l : st)
      if(l == '0')
        z++;
      else
        if(l == '-')
        d++;

    if(d + z < n)
    {
          for(char k : st)
              if(k != '-')
                cout << k;

          return;
    }

    cout << 0;
}
//--------------------------------------------
bool remone(int mo , string &st){

  int n = st.size();
  for(int i = n-1; i >= 0 ; i--)
  {
      int v = st[i] - '0';
      if(v % 3 == mo)
      {
          st[i] = '-';
          return true;
      }
  }

  return false;
}

bool remtwo(int mo , string &st)
{
  int f = 0;
    for(int i = st.size() - 1 ; i >= 0; i--)
    {
        int v = st[i] - '0';
        if(v % 3 == mo)
        {
            st[i] = '-';
            f++;
        }
        if(f == 2) break;
    }

    if(f == 2)
      return true;
    return false;
}
bool ans(int a , int b , int c){
  if(a == (b + c))
    return true;
  return false;
}
//============================================
int main() {
    ios::sync_with_stdio(false);
     cin.tie(0);
     cout.tie(0);
    #ifndef ONLINE_JUDGE
       freopen ("INPUT.txt" , "r" , stdin);
       freopen ("OUTPUT.txt", "w" , stdout);
    #endif

    int a , b ,c ;
    cin >> a >> b >> c;

    if(ans(2*a , b , c) || ans(2*a , c , b) || ans(2*b , a , c) || ans(2*b , c , a) || ans(2*c , a , b) || ans(2*c , b , a) ) 
      cout << "Yes";
    else
      cout << "No";


return 0;
} 