#include<bits/stdc++.h>
using namespace std;

#define F first
#define S second
#define pii pair<int, int>
#define pb push_back
#define debug(x) cerr << #x << "=" << x << endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a; i < (b); i++)
#define MP make_pair
#define SZ(x) (static_cast<int>(x.size()))
#define MOD 1000000007
#define ALL(x) x.begin(), x.end()
void inc(int &a, int b) {a = (a+b)%MOD;}
void dec(int &a, int b) {a = (a-b+MOD)%MOD;}
int lowbit(int x) {return x&(-x);}

const int MAXN = 555;

int dp[MAXN][MAXN][7];

map<char, int> mp;
int val[MAXN];
string s;
int m;

void solve(int l, int r) {
    if (dp[l][r][0] != -1) return;
    rep(i, 0, 7) dp[l][r][i] = -MOD;
    if (l == r) {
       dp[l][r][val[l]] = 1;
       if (m == 1) rep(i, 0, 7) dp[l][r][i] = max(0, dp[l][r][i]); 
    } 
    else {
      bool check = false;
      rep(mid, l, r) {
        rep(i, 0, 7) {
          solve(l, mid), solve(mid + 1, r);
          dp[l][r][i] = max(dp[l][r][i], dp[l][mid][i] + dp[mid + 1][r][i]);
          if (dp[l][r][i] >= m) check = true;
        }
      }
      if (check) rep(i, 0, 7) dp[l][r][i] = max(0, dp[l][r][i]);
    }
    return;
}

int32_t main() {
    ios_base::sync_with_stdio(false);cin.tie(0);
    mp['R'] = 0, mp['G'] = 1, mp['B'] = 2, mp['C'] = 3, mp['M'] = 4, mp['Y'] = 5, mp['K'] = 6;
    cin >> s >> m;
    int n = SZ(s);
    rep(i, 0, n) {
        val[i] = mp[s[i]];
 //       debug(val[i]);
    }
    memset(dp, -1, sizeof(dp));
    solve(0, n - 1);
    rep(i, 0, 7) if (dp[0][n - 1][i] >= m) {
        cout << "Yes";
        return 0;
    } 
    //debug(dp[3][8][0]);
    cout << "No";
}