#include <bits/stdc++.h>
using namespace std;
#define print(l) for(auto i:l) cout<<i<<" ";cout<<endl;
#define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i];
#define int long long
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define all(l) l.begin(),l.end()
#define pii pair<int,int>
#define fi first
#define se second
const int M = 1e9+7;
const int inf = 1e18;
int bp(int x, int y, int p){
int res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int MI(int n, int p){
return bp(n, p - 2, p);
}
int mul(int x,int y, int p){
return x * 1ull * y % p;
}
int di(int x,int y, int p){
return mul(x, MI(y, p), p);
}
int n , m , k , q;
string s;
int ck(vector<int>&ta,vector<int>&tb){
int a = 0;
int b = 0;
int l =0 ;
int r = 2*n-1;
for(int i = 0;i<n;i++){
if(ta[i]){
if(s[l] == 'C'){
a++;
}
l++;
}
else{
if(s[r] == 'C'){
a++;
}
r--;
}
if(a == k){
return 0;
}
if(tb[i]){
if(s[l] == 'C'){
b++;
}
l++;
}
else{
if(s[r] == 'C'){
b++;
}
r--;
}
if(b == k){
return 1;
}
}
}
void solve(int testcase_number){
cin>>n>>k;
cin>>s;
int rn = n;
n/=2;
// cout<<(1<<20) * 20<<endl;
for(int i =0;i<(1<<n);i++){
int ff = 0;
int jj = 0;
for(int j = 0;j<(1<<n);j++){
vector<int>ta,tb;
for(int ik =0 ;ik<n;ik++){
ta.pb(!(i&(1<<ik)));
tb.pb(!(j&(1<<ik)));
}
jj++;
ff+=ck(ta,tb);
}
if(ff == jj){
cout<<"DA"<<endl;
return;
}
}
cout<<"NE"<<endl;
}
signed main(){
ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
cin.tie(0), cout.tie(0);
cout << fixed<<setprecision(9);
int t = 1;
// cin>>t;
for(int i = 1;i<=t;i++){
solve(i);
}
}
