#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; void solve(int testcase_number){ cin>>n>>k; string s; cin>>s; int rn = n; n/=2; // cout<<(1<<20) * 20<<endl; for(int i =0;i<(1<<n);i++){ int ff = 1; for(int j = 0;j<(1<<n);j++){ int l = 0; int r = rn-1; int a =0 ; int b = 0; int t = 1; int idx = n-1; int f = 1; while(l < r){ if(t){ if(i&(1<<idx)){ if(s[l] == 'C'){ a++; } l++; } else{ if(s[r] == 'C'){ a++; } r--; } } else{ if(j&(1<<idx)){ if(s[l] == 'C'){ b++; } l++; } else{ if(s[r] == 'C'){ b++; } r--; } idx--; } if(a==k ){ f = 0; break; } if(b == k){ break; } t^=1; } if(f == 0){ ff =0 ; break; } } if(ff){ 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); } }