#include<bits/stdc++.h>
using namespace std;
#define int long long
#define f first
#define s second
#define mp make_pair
#define eb emplace_back
#define pb push_back
typedef pair<int,int> pii;

const int mxn=505;

bool dp[mxn][mxn];
char same[mxn][mxn];

int32_t main() {
    ios_base::sync_with_stdio(false);cin.tie(0);
    string s;
    int n,m;
    cin>>s>>m;
    n=s.length();
    
    for(int l=0;l<n;l++){
        same[l][l]=s[l];
        for(int r=l+1;r<n;r++){
            if(s[r]==same[l][r-1])same[l][r]=s[r];
            else same[l][r]='x';
        }
    }

    for(int l=0;l+m<=n;l++){
        dp[l][l+m-1] = (same[l][l+m-1]!='x');
    }

    for(int sz=m;sz<=n;sz++){
        for(int l=0;l+sz<=n;l++){
            int r = l+sz-1;
            if(!dp[l][r])continue;
            // cout<<"Possible: "<<l<<' '<<r<<'\n';

            if(l>0 && s[l]==s[l-1])dp[l-1][r]=1;
            if(r+1 < n && s[r]==s[r+1])dp[l][r+1]=1;

            for(int i=0;i<=m;i++){
                if(l-i < 0)continue;
                if(r+m-i >= n)continue;
                if(l-i<=l-1 && same[l-i][l-1]=='x')continue;
                if(r+1<=r+m-i && same[r+1][r+m-i]=='x')continue;
                if(l-i <= l-1 && r+1 <= r+m-i && same[l-i][l-1] != same[r+1][r+m-i])continue;
                dp[l-i][r+m-i]=true;
            }
        }
    }
    if(dp[0][n-1])cout<<"Yes\n";
    else cout<<"No\n";
}
/*
BBBRRRRRRGGGB 3
BBBRRRRRRGGGB 4
*/