#pragma GCC optimize("O3", "unroll-loops") // "Ofast"
#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt")
#include <bits/stdc++.h>
#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define f first
#define s second
#define dbg(x) cerr << #x << " = " << x << '\n'
#define bit(x, i) ((x) >> (i) & 1)
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
const int N = 1e6 + 5, mod = 1e9 + 7;
const ll inf = 1e18 + 7;
const ld eps = 1e-6;
int n, k, dp[400][400][400], p[N];
string s;
bool rec (int l, int r, int f) {
int s = p[n] - (p[r] - p[l - 1]) - f;
int &res = dp[l][r][f];
if (res != -1) return res;
if (f >= k) res = 0;
if (s >= k) res = 1;
if (res != -1) return res;
res = (!rec(l + 1, r, s) || !rec(l, r - 1, s));
return res;
}
void solve () {
cin >> n >> k >> s;
s = ' ' + s;
for (int i = 1; i <= n; i++) p[i] = p[i - 1] + (s[i] == 'C');
memset(dp, -1, sizeof(dp));
cout << (rec(1, n, 0) ? "DA" : "NE");
cout << '\n';
}
bool testcases = 0;
signed main() {
#ifdef ONLINE_JUDGE
freopen(".in", "r", stdin);
freopen(".out", "w", stdout);
#endif
cin.tie(0) -> sync_with_stdio(0);
int test = 1;
if (testcases) cin >> test;
for (int cs = 1; cs <= test; cs++) {
solve();
}
}
