def Run_Length(lst):
    run_length=[]
    if lst:
        prev=lst[0]
        cnt=1
        for x in lst[1:]:
            if x==prev:
                cnt+=1
            else:
                run_length.append((prev,cnt))
                prev=x
                cnt=1
        run_length.append((prev,cnt))
    return run_length

S,M=input().split()
N=len(S)
S=list(S)
for i in range(N):
    S[i]=ord(S[i])-65
M=int(M)
dp=[[0]*(N+1) for n in range(N+1)]
prev=[[None]*N for a in range(26)]
for a in range(26):
    for i in range(N):
        if S[i]==a:
            prev[a][i]=i
        elif i:
            prev[a][i]=prev[a][i-1]
nxt=[[None]*N for a in range(26)]
for a in range(26):
    for i in range(N-1,-1,-1):
        if S[i]==a:
            nxt[a][i]=i
        elif i<N-1:
            nxt[a][i]=nxt[a][i+1]
for d in range(N+1):
    for l in range(N-d+1):
        r=l+d
        if d==0:
            dp[l][r]=1
        else:
            for m in range(l+1,r):
                dp[l][r]|=dp[l][m]&dp[m][r]
            for s in range(26):
                idx=[]
                i=nxt[s][l]
                while i!=None and i<r:
                    idx.append(i)
                    if i==N-1:
                        break
                    i=nxt[s][i+1]
                L,R=[l],[]
                for i in idx:
                    R.append(i)
                    L.append(i+1)
                R.append(r)
                if all(dp[ll][rr] for ll,rr in zip(L,R)) and len(idx)>=M:
                    dp[l][r]=1
if dp[0][N]:
    ans="Yes"
else:
    ans="No"
print(ans)