#include<bits/stdc++.h>
using namespace std;
const int N=1919810;
typedef long long ll;
typedef pair<ll,ll> PII;
ll n,m,k;
ll a[N],b[N];
char s[N];
bool dp[514][514];

bool check(int l,int r){
    for(int i=l;i<r;i++){
        if(dp[l][i]&&dp[i+1][r]) return true;
    }

    int len=r-l+1;
    int i=l,j=r;
    while(i<=r&&s[l]==s[i]) i++;
    while(j>=i&&s[j]==s[r]) j--;
    if(i>r){
        if(len>=m) return true;
        else return false;
    }
    if(dp[i+1][r]&&i-l>=m) return true;
    if(dp[l][j]&&r-j>=m) return true;
    if(s[l]==s[r]){
        if(dp[i][j]&&len-(j-i+1)>=m) return true;
    }

    return false;
}

int main(){
    scanf("%s",s+1);
    cin>>m;
    n=strlen(s+1);
    for(int len=1;len<=n;len++){
        for(int i=1;i+len-1<=n;i++){
            int l=i,r=i+len-1;
            dp[l][r]=check(l,r);
            // cout<<l<<" "<<r<<" "<<dp[l][r]<<endl;
        }
    }
    if(dp[1][n])  puts("Yes");
    else puts("No");  
}