#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <climits>
#include <functional>
#include <cassert>
#include <numeric>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define per(i, n) for(int i = (n) - 1; i >= 0; i--)
using ll = long long;
#define vi vector<int>
#define vvi vector<vi>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
constexpr int mod = 1000000007;
using namespace std;
template<class T, class U>
bool chmax(T &a, const U &b){ return a < b ? (a = b, 1) : 0; }
template<class T, class U>
bool chmin(T &a, const U &b){ return a > b ? (a = b, 1) : 0; }
const int uruu[] = { -1, 1,-2,1,0,1,0,1,1,0,1,0,1 };
void check(int m, int d, int cnt[]){
  rep(i, 2){
    cnt[m % 10]++;
    m /= 10;
    cnt[d % 10]++;
    d /= 10;
  }
}
int main(){
  int m,d,K;
  cin >> m >> d >> K;
  int cnt[10] = {};
  rep(_, 7){
    check(m, d, cnt);
    d++;
    if(d == 31 + uruu[m]){
      d = 1;
      m++;
      if(m == 13) m = 1;
    }
  }
  int num = 0;
  rep(i, 10) if(cnt[i]) num++;
  if(num >= K) cout << "Yes\n";
  else cout << "No\n";
}