#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;

#ifdef WAIMAI
#define debug(HEHE...) cout<<"["<<#HEHE<<"] : ",dout(HEHE)
void dout(){cout<<'\n';}
template<typename T,typename...U>
void dout(T t,U...u){cout<<t<<(sizeof...(u)?", ":""),dout(u...);}
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false),cin.tie(0)
#define FOR(x,a,b) for(int x=a,I=b;x<=I;x++)
#define pb emplace_back
#define F first
#define S second

const int INF = 1e9;
const int SIZE = 505;
const string color = " RGBCMYK";

int n, m;
string s;
int cl[SIZE], a[SIZE];
int dp[SIZE][SIZE][8];

void solve() {
    cin >> s >> m;
    n = s.size();
    s = " " + s;

    for (int i = 1, c = 0, len = 0; i <= n; i++) {
        len++;
        if (i == n || s[i] != s[i + 1]) {
            c++;
            FOR (j, 1, 7) if (s[i] == color[j]) cl[c] = j;
            a[c] = len;
            len = 0;
        }
        if (i == n) n = c;
    }

    FOR (i, 1, n) {
        fill (dp[i][i], dp[i][i] + 8, -INF);
        dp[i][i][cl[i]] = a[i];
    }
    FOR (len, 2, n) for (int l = 1, r = len; r <= n; l++, r++) {
        fill (dp[l][r], dp[l][r] + 8, -INF);
        FOR (k, l, r - 1) {
            int mx = *max_element (dp[k + 1][r], dp[k + 1][r] + 8);
            FOR (x, 1, 7) if (dp[l][k][x] != -INF) {
                dp[l][r][x] = max (dp[l][r][x], dp[l][k][x] + max (dp[k + 1][r][x], mx >= m ? 0 : -INF));
            }
            mx = *max_element (dp[l][k], dp[l][k] + 8);
            FOR (x, 1, 7) if (dp[k + 1][r][x] != -INF) {
                dp[l][r][x] = max (dp[l][r][x], dp[k + 1][r][x] + max (dp[l][k][x], mx >= m ? 0 : -INF));
            }
        }
    }
    cout << (*max_element (dp[1][n], dp[1][n] + 8) >= m ? "Yes\n" : "No\n");
}

int32_t main() {
    Waimai;
	solve();
}