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

#define rep(i,a,b) for(int i=a;i<b;++i)
#define all(x) begin(x),end(x)
#define sz(x) (int)(x).size();
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
int dp[7][555][555];
int can[555][555];
string col = "RGBCMYK";
int main()
{
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);
    int m;
    string s;
    cin>>s>>m;

    int n = sz(s);
    vector<int>v(n);
    for(int i=0;i<n;i++){
        for(int j=0;j<7;j++){
            if(s[i] == col[j])v[i] = j;
        }
    }
   // for(int x:v)cout<<x<<" ";
    //cout<<'\n';
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            for(int k=0;k<7;k++)dp[k][i][j] = -1e9;
        }
    }
    for(int i=0;i<n;i++){
        for(int j=i;j<n;j++){
            if(v[j] != v[i])break;
            dp[v[i]][i][j] = j-i+1;
        }
    }

    for(int len=1;len<n;len++){
        for(int i=0;i+len<n;i++){
            for(int c=0;c<7;c++){
                int l = i;
                int r = i+len;
                for(int j=l;j<r;j++){
                    if(dp[c][l][j] >= 0 && dp[c][j+1][r] >= 0)dp[c][l][r] = max(dp[c][l][r],dp[c][l][j]+dp[c][j+1][r]);
                    
                    if(can[l][j])dp[c][l][r] = max(dp[c][l][r],dp[c][j+1][r]);
                    if(can[j+1][r])dp[c][l][r] = max(dp[c][l][r],dp[c][l][j]);
                }
                if(dp[c][l][r] >= m)can[l][r] = 1;
                //if(dp[c][l][r]>=0)cout<<c<<" "<<l<<" "<<r<<" "<<dp[c][l][r]<<'\n';
            }
        }
    }
    if(can[0][n-1])cout<<"Yes"<<'\n';
    else cout<<"No"<<'\n';

}