#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

pair<int, int> next_day(const int m, const int d) {
  if (d == 28) {
    if (m == 2) return {3, 1};
  } else if (d == 30) {
    if (m == 4 || m == 6 || m == 9 || m == 11) return {m + 1, 1};
  } else if (d == 31) {
    if (m == 1 || m == 3 || m == 5 || m == 7 || m == 8 || m == 10) return {m + 1, 1};
    if (m == 12) return {1, 1};
  }
  return {m, d + 1};
}

int main() {
  int m, d, k; cin >> m >> d >> k;
  set<char> s;
  REP(_, 7) {
    for (const char c : to_string(m)) s.emplace(c);
    for (const char c : to_string(d)) s.emplace(c);
    if (m < 10 || d < 10) s.emplace('0');
    tie(m, d) = next_day(m, d);
  }
  cout << (s.size() >= k ? "Yes\n" : "No\n");
  return 0;
}