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

#define ov4(a, b, c, d, name, ...) name
#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep2(i, a, b) rep3(i, a, b, 1)
#define rep1(i, n) rep2(i, 0, n)
#define rep0(n) rep1(aaaaa, n)
#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define all(v) v.begin(), v.end()

using pl = pair<ll, ll>;
using vl = vector<ll>;
using vpl = vector<pl>;
template <size_t N>
using al = array<ll, N>;
template <size_t N>
using val = vector<al<N>>;
using sl = set<ll>;
template <class T>
using vc = vector<T>;
template <class T>
using vvc = vc<vc<T>>;
using vvl = vvc<ll>;
using str = string;

void solve() {
    str s;
    ll m;
    cin >> s >> m;
    ll n = s.size();
    al<128> com = {};
    com['R'] = 0;
    com['G'] = 1;
    com['B'] = 2;
    com['C'] = 3;
    com['M'] = 4;
    com['Y'] = 5;
    com['K'] = 6;
    vvc<al<7>> dp(n, vc<al<7>>(n + 1));
    rep(i, n) {
        dp[i][i] = al<7>{0, 0, 0, 0, 0, 0, 0};
    }
    rep(i, n) {
        if (m > 1)
            dp[i][i + 1] = al<7>{-1, -1, -1, -1, -1, -1, -1};
        else
            dp[i][i + 1] = {};
        dp[i][i + 1][com[s[i]]] = 1;
    }
    rep(w, 2, n + 1) {
        rep(i, n - w + 1) {
            const ll j = i + w;
            assert(0 <= j && j <= n);
            dp[i][j] = al<7>{-1, -1, -1, -1, -1, -1, -1};
            bool f = false;
            rep(k, i + 1, j) {
                rep(c, 7) {
                    if (dp[i][k][c] >= 0 && dp[k][j][c] >= 0) {
                        dp[i][j][c] = max(dp[i][j][c], dp[i][k][c] + dp[k][j][c]);
                        if (dp[i][j][c] >= m)
                            f = true;
                    }
                }
            }
            if (f) rep(c, 7) if (dp[i][j][c] < 0) dp[i][j][c] = 0;
        }
    }
    cout << (*max_element(all(dp[0][n])) >= m ? "Yes" : "No") << endl;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cout << fixed << setprecision(20);
    ll t = 1;
    // cin >> t;
    rep(t) solve();
}