#include <bits/stdc++.h>

using namespace std;

using ll = long long;
template <class T = int> using V = vector<T>;
template <class T = int> using VV = vector<V<T>>;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }

#define rep(i, n) for(int i = 0; i < (int) n; i++)

struct Calender {
    int year = 0, month = 0, day = 0;
    int date = 0;
    vector<int> end = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
    // date = 0 ... Sunday
    Calender() {
        year = 1900, month = 1, day = 1;
        date = 1;
    }
    Calender (int y, int m, int d) {
        year = y;
        if (is_leap_year(y)) end[2] = 29;
        month = m;
        day = d;
    }
    Calender (int y, int m, int d, int dt) {
        year = y;
        if (is_leap_year(y)) end[2] = 29;
        month = m;
        day = d;
        date = dt;
    }

    bool is_leap_year(int y) {
        if (y % 400 == 0) return true;
        else if (y % 100 == 0) return false;
        else if (y % 4 == 0) return true;
        else return false;
    }

    void next() {
        date = (day + 1) % 7;
        day++;
        if (end[month] < day) {
            day = 1;
            month++;
            if (month == 13) {
                month = 1;
                year++;
                if (is_leap_year(year)) end[2] = 29;
                else end[2] = 28;
            }
        }
    }
};

int main() {
    int m, d, k;
    cin >> m >> d >> k;
    Calender cd(2, m, d);
    set<int> s;
    rep(i, 7) {
        int month = cd.month;
        int day = cd.day;
        s.insert(month / 10);
        s.insert(month % 10);
        s.insert(day / 10);
        s.insert(day % 10);
        cd.next();
    }
    cout << ((int) s.size() >= k ? "Yes" : "No") << endl;
}