#include // cout, endl, cin #include // string, to_string, stoi #include // vector #include // min, max, swap, sort, reverse, lower_bound, upper_bound #include // pair, make_pair #include // tuple, make_tuple #include // int64_t, int*_t #include // printf #include // map #include // queue, priority_queue #include // set #include // stack #include // deque #include // unordered_map #include // unordered_set #include // bitset #include // isupper, islower, isdigit, toupper, tolower #include //fixed,setprecision //#include //INT_MAX //#include //M_PI #include #include // 正規表現 #include //#include using namespace std; //#include //using namespace atcoder; //using mint = modint1000000007; //using mint = modint998244353; //using mint=modint; template bool chmax(T &u, const T z) { if (u < z) {u = z; return true;} else return false; } template bool chmin(T &u, const T z) { if (u > z) {u = z; return true;} else return false; } #define ll long long #define rep(i, n) for (ll i = 0; i < (ll)(n); i++) //typedef pair P; //typedef pairP; //typedef pair q; int main(){ int m,d,k; cin>>m>>d>>k; m*=100; int sum=m+d; mapmp; rep(i,7){ string s=to_string(sum); if(s.size()==3)mp['0']++; rep(j,s.size())mp[s[j]]++; if(sum/100==2&&sum%100==28){ sum=301; }else if((sum/100==4||sum/100==6||sum/100==9||sum/100==11)&&(sum%100==30)){ sum+=100; sum-=30; sum+=1; }else if(sum/100==12&&sum%100==31){ sum=101; }else if((sum/100==1||sum/100==3||sum/100==5||sum/100==7||sum/100==8||sum/100==10||sum/100==12)&&(sum%100==31)){ sum+=100; sum-=31; sum+=1; }else{ sum++; } } //for(auto p:mp)cout<=k)cout<<"Yes"<