#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define all(x) x.begin(),x.end()
//#define mp make_pair
#define vi vector<int>
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vll>
#define vs vector<string>
#define vvs vector<vs>
#define vc vector<char>
#define vvc vector<vc>
#define pii pair<int,int>
#define pllll pair<ll,ll>
#define vpii vector<pair<int,int>>
#define vpllll vector<pair<ll,ll>>
#define vpis vector<pair<int,string>>
#define vplls vector<pair<ll, string>>
#define vpsi vector<pair<string, int>>
#define vpsll vector<pair<string, ll>>

template<typename T>
void chmax(T &a, const T &b) {a = (a > b? a : b);}
template<typename T>
void chmin(T &a, const T &b) {a = (a < b? a : b);}

using ll = long long;
using ld = long double;
using ull = unsigned long long;

const ll INF = numeric_limits<long long>::max() / 2;
const ld pi = 3.1415926535897932384626433832795028;
const ll mod = 998244353;
int dx[] = {-1, 0, 1, 0, -1, 1, -1, 1};
int dy[] = {0, -1, 0, 1, -1, -1, 1, 1};

#define int long long

set<int> ls = {1, 3, 5, 7, 8, 10, 12};

void nxt(string& ms, string& ds) {
    int ims = stoi(ms), ids = stoi(ds);
    ids++;

    if(ids == 31) {
        if(ls.find(ims) == ls.end()) {
            ims++;
            ids = 1;
        }
    }else if(ids == 32) {
        ims++;
        ids = 1;
    }
    if(ims == 13) {
        ims = 1;
    }

    ms = to_string(ims);
    ds = to_string(ids);
    if(ms.size() == 1) ms.insert(ms.begin(), '0');
    if(ds.size() == 1) ds.insert(ds.begin(), '0');
    return;
}

void solve() {
    int m, d, k;
    cin >> m >> d >> k;
    string ms = to_string(m), ds = to_string(d);
    if(ms.size() == 1) ms.insert(ms.begin(), '0');
    if(ds.size() == 1) ds.insert(ds.begin(), '0');

    set<char> st;

    FOR(7) {
        // cout << ms << " " << ds << endl;
        for(auto e : ms) st.insert(e);
        for(auto e : ds) st.insert(e);
        nxt(ms, ds);
    }

    if(st.size() >= k) cout << "Yes" << endl;
    else cout << "No" << endl;
}
//euler tourの点更新、辺更新の追加

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}