import sys
#input = sys.stdin.readline
#input = sys.stdin.buffer.readline #文字列はダメ
#sys.setrecursionlimit(1000000)
#import math
import bisect
#import itertools
#import random
#from heapq import heapify, heappop, heappush
from collections import defaultdict
#from collections import deque
#import copy #DeepCopy: hoge = [_[:] for _ in hogehoge]
#from functools import lru_cache
#@lru_cache(maxsize=None)
MOD = pow(10,9) + 7
#MOD = 998244353
#dx = [1,0,-1,0]
#dy = [0,1,0,-1]
#dx8 = [1,1,0,-1,-1,-1,0,1]
#dy8 = [0,1,1,1,0,-1,-1,-1]


def main():
    M,D,K = map(int,input().split())
    days = [-1,31,28,31,30,31,30,31,31,30,31,30,31]

    used = set([])

    def addboth(a,b):
        used.add(a//10)
        used.add(a%10)
        used.add(b//10)
        used.add(b%10)

    addboth(M,D)

    for i in range(6):
        D += 1
        if D > days[M]:
            D = 1
            if M == 12:
                M = 1
            else:
                M += 1
        # print(M,D)
        addboth(M,D)
    
    if len(used) >= K:
        print('Yes')
    else:
        print('No')



if __name__ == '__main__':
    main()