#include<bits/stdc++.h>
#define fori(i,a,b) for(int i=a;i<=b;i++)
#define int long long
#define pb push_back
using namespace std;
typedef pair<int,int> ii;
typedef tuple<int,int,int> tp;
const int M = 1e6 + 10;
const int N = 355;
const int mod = 1e9 + 7;
int n, k;
char ch[N];
bool f[N][N][N], dd[N][N][N];
bool dp(int l,int r,int tt,int a,int b)
{
if(a == k) return 0;
if(b == k) return 1;
if(l > r) return 0;
bool &ret = f[l][r][a];
if(dd[l][r][a]) return ret;
dd[l][r][a] = true;
if(tt) {
ret = dp(l + 1,r,1 - tt,a,b + (ch[l] == 'C'));
if(ret == 1) {
ret = dp(l,r - 1,1 - tt,a,b + (ch[r] == 'C'));
}
}
else {
ret = dp(l + 1,r,1 - tt,a + (ch[l] == 'C'),b);
if(ret == 0) {
ret = dp(l,r - 1,1 - tt,a + (ch[r] == 'C'),b);
}
}
return ret;
}
int32_t main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
if(fopen("1.inp","r")) {
freopen("1.inp","r",stdin);
freopen("1.out","w",stdout);
}
#define task ""
if(fopen(task".inp","r")) {
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
cin >> n >> k;
for(int i = 1;i <= n; i++) cin >> ch[i];
if(dp(1,n,0,0,0) == 1) cout << "DA";
else cout << "NE";
}
