#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>

#define EPS 1e-9
#define PI acos(-1.0)
#define ll long long
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
#define pb push_back
#define ft first
#define sc second
#define pi pair<ll,ll>
#define vi vector<ll>
#define sz(s) s.size()
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<ll, null_type, less<ll>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
const ll N = 2e5+5, M = 500+2, MOD = 1e4+5, INF = 1e18;
int dx[] = {-1, 1, 0, 0}, Dx[] = {-1, -1, 0, 1, 1, 1, 0, -1};;
int dy[] = {0, 0, 1, -1}, Dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
int n, m, t ,mp[M];
bool dp[M][M][M][7],vis[M][M][M][7];
string s;
int solve(int l,int r,int cnt,int dir)
{
   // if(l == 0) cout << l << ' ' << r << ' ' << cnt << endl;
    if(l == 0 && r == sz(s)-1) return cnt >= m;
    bool &ret = dp[l][r][cnt][dir];
    if(vis[l][r][cnt][dir])
        return ret;
    vis[l][r][cnt][dir] = true;
    if(r < sz(s)-1 && mp[r+1] == dir)
        ret |= solve(l,r+1,cnt+1,mp[r+1]);
    if(l > 0 && mp[l-1] == dir)
        ret |= solve(l-1,r,cnt+1,mp[l-1]);
    if(cnt >= m){
        if(l > 0)
            ret |= solve(l-1,r,1,mp[l-1]);
        if(r < sz(s)-1)
            ret |= solve(l,r+1,1,mp[r+1]);
    }
    return ret;
}
int main()
{
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);//freopen("lines.in", "r", stdin);
    cin >> s >> m;
    if(m == 1) return cout << "Yes",0;
    memset(dp,0,sizeof dp);
    map<char,int> id;
    int i = 0;
    for(int j = 0; j < sz(s) ;++j)
    {
        if(id.count(s[j]) == 0) id[s[j]] = i++;
        mp[j] = id[s[j]];
    }
    int mx = 0;
    for(int i = 0; i < sz(s) ;++i) mx |= solve(i,i,1,mp[i]);
    cout << (mx?"Yes":"No");
    return 0;
}
/*

*/