#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int m, d, k; cin >> m >> d >> k;
	set<int>st;
	vector<int>v = { 31,28,31,30,31,30,31,31,30,31,30,31 };
	rep(i, 7) {
		int cm = m, cd = d;
		if (cm < 10)st.insert(0);
		while (cm) {
			st.insert(cm % 10);
			cm /= 10;
		}
		if (cd < 10)st.insert(0);
		while (cd) {
			st.insert(cd % 10);
			cd /= 10;
		}
		d++;
		if (d > v[m - 1]) {
			d = 1;
			m++;
			if (13 == m)m = 1;
		}
	}
	if (st.size() >= k)cout << "Yes" << endl;
	else cout << "No" << endl;
	return 0;
}