#include <bits/stdc++.h>
using namespace std;
const long long N = 51, mod = 1e9 + 7, base = 31;
int dp[N][N][N][N][2];
int n, k;
string x;
int solve(int l, int r, int rem1, int rem2, int t)
{
if (rem1 == 0)
return 0;
if (rem2 == 0)
return 1;
if (~dp[l][r][rem1][rem2][t])
return dp[l][r][rem1][rem2][t];
if (t)
return dp[l][r][rem1][rem2][t] = min(solve(l + 1, r, rem1, rem2 - (x[l] == 'C'), 0), solve(l, r - 1, rem1, rem2 - (x[r] == 'C'), 0));
else
return dp[l][r][rem1][rem2][t] = max(solve(l + 1, r, rem1 - (x[l] == 'C'), rem2, 1), solve(l, r - 1, rem1 - (x[r] == 'C'), rem2, 1));
}
int main()
{
memset(dp, -1, sizeof dp);
cin >> n >> k;
cin >> x;
cout << (solve(0, n - 1, k, k, 0) ? "DA" : "NE");
}
