// #ifdef __AVX2__ // #pragma GCC target "avx2" // #endif // #pragma GCC optimize "O3" // #pragma GCC optimize "unroll-loops" #include <bits/stdc++.h> // #include <ext/pb_ds/assoc_container.hpp> // #include <ext/pb_ds/tree_policy.hpp> // using namespace __gnu_pbds; using namespace std; #define int long long #define elif else if #define all(l) begin(l),end(l) #define rall(l) rbegin(l),rend(l) #define append push_back #define print(l) for(auto i:l) cout<<i<<' '; cout<<endl; #define pprint(a,b) cout<<a<<' '<<b<<endl; #define inp(l) for(auto &i:l) cin>>i; // #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> #define pai make_pair #define endl "\n" #define pii pair<int,int> #define fi first #define se second #define vec vector #define ins(a,b,c) a.insert(begin(a)+b,c); // const int mod=998244353; const int mod1=998244353; const int mod=1e9+7; const int N=2e5+5; int iter=1,itera=1; void solve(){ int n,k; cin>>n>>k; string s; cin>>s; s='.'+s; vec<int>p(n+1,0); for(int i=1;i<=n;i++) p[i]=p[i-1]+(s[i]=='C'); vec<vec<vec<bool>>>dp(n+1,vec<vec<bool>>(n+1,vec<bool>(k+1,0))); for(int i=0;i<=n;i++){ for(int j=i-1;j>=0;j--){ for(int t=0;t<=k;t++) dp[i][j][t]=1; } } string ans="NE"; for(int len=1;len<=n;len++){ for(int l=1;l+len-1<=n;l++){ int r=l+len-1; bool x=(n-(r-l+1))%2; x^=1; for(int t=0;t<=k;t++){ int fi=t,se=p[n]-(p[r]-p[l-1])-t; if(se<0 or se>k) continue; if(x){ bool id=0; if((fi+(s[l]=='C'))<=k){ int fi1=fi+(s[l]=='C'); id=dp[l+1][r][fi1]; } if(fi+(s[r]=='C')<=k){ int fi1=fi+(s[r]=='C'); id|=dp[l][r-1][fi1]; } dp[l][r][t]=id; } else{ bool id=1; if((se+(s[l]=='C'))<=k){ id&=dp[l+1][r][t]; } if(se+(s[r]=='C')<=k){ id&=dp[l][r-1][t]; } dp[l][r][t]=id; } if(len==n and dp[l][r][t]){ ans="DA"; } } } } cout<<ans<<endl; } signed main(){ // freopen("","r",stdin); // freopen("","w",stdout); ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cout<<fixed<<setprecision(20); // cin>>itera; for(iter=1;iter<=itera;iter++) solve(); }