//*** Bismillah ***//
#pragma GCC optimize("O3", "fast-math", "unroll-loops", "no-stack-protector")
#include <bits/stdc++.h>
using namespace std;
#if !defined(ONLINE_JUDGE) and !defined(EVAL)
#include "template/debug.h"
#else
#define d(x...)
#endif
#define fr first
#define er erase
#define sc second
#define in insert
#define ll long long
#define pb push_back
#define vll vector<ll>
#define pll pair<ll,ll>
#define ull unsigned ll
#define vpll vector<pll>
#define len(x) (ll) x.size()
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const ll INFL = 1e18;
const ll MOD = 1e9+7;
// const ll MOD = 998244353;
const ll maxn = 2e5+5;
ll n,m,k=0;
string s;
// i -> sol serhed
// j -> sag serhed
// q -> A-nin goturduyu das sayi
ll dp[355][355][355], ps[maxn];
ll f(ll l = 1, ll r = n, ll q = 0, ll nw = 0){
if(dp[l][r][q] != -1) return dp[l][r][q];
if(r - l + 1 == m){
if(ps[r] - ps[l - 1] != r - l + 1) return dp[l][r][q] = 0;
return dp[l][r][q] = (nw != 0);
}
if(nw){
if(f(l + 1, r, q + 1, !nw) or f(l, r - 1, q + 1, !nw)) return dp[l][r][q] = 1;
return dp[l][r][q] = 0;
}
else{
if(f(l + 1, r, q, !nw) or f(l, r - 1, q, !nw)) return dp[l][r][q] = 0;
return dp[l][r][q] = 1;
}
}
void _(ll &tt){
cin >> n >> m;
cin >> s;
s = ' ' + s;
memset(dp, -1, sizeof(dp));
for(ll i = 1; i <= n; i ++) ps[i] = ps[i - 1] + (s[i] == 'C');
cout << (f() ? "DA\n" : "NE\n");
}
signed main() {
ll tm = clock();
cin.tie(0)->sync_with_stdio(0);
ll t = 1;
// cin >> t;
for(ll tt = 1; tt <= t; tt ++) {
_(tt);
}
cerr << "\n\033[1;31mTime: \033[1;30m" \
<< (double)(clock()-tm)/1000000 << "\033[1;32m seconds\n";
}
