#include<bits/stdc++.h>
using namespace std;
#define rep2(i,j,k) for(ll i = ll(j); i < ll(k); i++)
#define rep(i,k) rep2(i,0,k)
#define rrep2(i,j,k) for(ll i = ll(j)-1; i >= ll(k); i--)
#define rrep(i,k) rrep2(i,k,0)
#define all(a) a.begin(), a.end()
#define SZ(a) ll(a.size())
#define eb emplace_back
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vp = vector<P>;
using vvp = vector<vp>;
const ll inf = LLONG_MAX/4;
bool chmin(auto& a, auto& b) {return a > b ? a = b, 1 : 0; }
bool chmax(auto& a, auto& b) {return a < b ? a = b, 1 : 0; }

int main(){
	cin.tie(0)->sync_with_stdio(0);
	string s; cin >> s;
	ll n = SZ(s);
	ll m; cin >> m;
	vvl dp(n+1, vl(n+1));	
	rep(i,n+1) dp[i][i] = 1;
	rep2(w,1,n+1){
		rep(l,n){
			ll r = l+w;
			if(r > n) break;
			rep2(k,l+1,r){
				dp[l][r] |= (dp[l][k] & dp[k][r]);
			}
			ll last = l;
			ll cnt = 1;
			ll flag = 1;
			rep2(k,l+1,r){
				if(s[l] != s[k]) continue;
				cnt++;
				flag &= dp[last+1][k];
				last = k;
			}
			flag &= dp[last+1][r];
			if(flag && cnt >= m) dp[l][r] = 1;
		}
	}
	string ans = "No";
	if(dp[0][n]) ans = "Yes";
	cout << ans << endl;
}