#include <atcoder/modint>

using mint = atcoder::modint998244353;
using ll = long long;

#include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
#include<set>

int main() {

  int M, D, K;
  std::cin >> M >> D >> K;
  std::set<int> s;
  const auto add = [&](int x) {
    s.insert(x / 10);
    s.insert(x % 10);
  };
  const auto check = [&]() {
    add(M);
    add(D);
  };

  std::vector<int> end = { 0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };

  for (int i = 0; i < 7; i++) {
    check();
    if (D == end[M]) {
      M += 1;
      D = 1;
      if (M == 13) {
        M = 1;
      }
    }
    else {
      D += 1;
    }
  }

  std::cout << (s.size() >= K ? "Yes" : "No") << "\n";

  return 0;
}