#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_set>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i, n) _rep2(i, 0, n)
#define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using i64 = long long;
template<class T, class U>
bool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; }
template<class T, class U>
bool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; }
inline void YesNo(bool f, string yes = "Yes", string no = "No") { std::cout << (f? yes: no) << std::endl; }


template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}
template<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}
template<typename T>string join(vector<vector<T>>&vv){string s="\n";rep(i,vv.size())s+=join(vv[i])+"\n";return s;}
template<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}

pair<int, int> a(int r) {
    if (r < 10) return {0, r};
    return {r % 10, r / 10};
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int m, d, k;
    cin >> m >> d >> k;
    set<int> s;
    set<int> cor = {4, 6, 9, 11};
    rep(_, 7) {
        auto [p, q] = a(m);
        s.insert(p);
        s.insert(q);
        auto [u, v] = a(d);
        s.insert(u);
        s.insert(v);
        d++;
        if (cor.count(m) && d == 31) m++, d = 1;
        if (m == 2 && d == 29) m++, d = 1;
        if (d == 32) m++, d = 1;
        if (m == 13) m = 1;
    }
    YesNo(s.size() >= k);
}