#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>
#include <iterator>

typedef long long int ll;
//#include<bits/stdc++.h>


using namespace std;

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}

long long mod_exp(long long b, long long e, long long m) {
    if (e > 0 && b == 0) return 0;
    long long ans = 1;
    b %= m;

    while (e > 0) {
        if ((e & 1LL)) ans = (ans * b) % m;
        e = e >> 1LL;
        b = (b * b) % m;
    }

    return ans;
}


int main()
{

    int Q;
    Q = 1;
    //cin >> Q;



    while (Q--) {
        int m, d, k;
        cin >> m >> d >> k;
        set<int>s;
        for (int i = 0; i < 7; i++) {
            
            if ((m == 4 || m == 6 || m == 9 || m == 11)) {
                if (d == 31) {
                    d = 1; m++;
                }
            }
            else if (m == 2) {
                if (d == 29) {
                    d = 1; m = 3;
                }
            }
            else if (d == 32) {
                d = 1; m++; m %= 12;
                if (!m)m = 1;
            }
            //cout << m << " " << d << endl;
            s.insert(m/10); s.insert(m % 10);
            s.insert(d / 10); s.insert(d % 10);
            d++;
        }
        //cout << s.size();
        if (s.size() >= k)cout << "Yes";
        else cout << "No";
    }
        return 0;
}