#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define int long long
//#define int double
typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
typedef vector<bool> vb;
#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)
#define all(x) x.begin(),x.end()
#define fi first
#define se second
#define pb push_back
#define sp <<" "<<
#define cont(x) for(auto el:x) cout<<el<<' ';cout<<endl;
#define contp(x) for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;
#define DEBUG(x) cout<<#x sp x<<endl;
#define carp(x,y) ((x%MOD)*(y%MOD))%MOD
#define topla(x,y) ((x%MOD)+(y%MOD))%MOD
#define mid (l+r)/2
const int MAXN=1e5+5;
const int MOD=1e9+7;
const int INF=1e18;
int say[MAXN];
int temp[MAXN];
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n,k;
cin>>n>>k;
vector<string> grid(n);
FOR(i,n){
cin>>grid[i];
FOR(j,n){
if(grid[i][j]=='o'){
say[j]++;
}
}
}
int mn=0;
//her column için fliplenmiş hali mi yoksa kendisi mi daha optimal bak
//neye göre daha optimal? --> min openlı en optimali
FOR(j,n) mn+=min(say[j],n-say[j]);
//her row için fliplenmiş hali daha optimalse o rowu fliple
FOR(i,n){ //i. rowu fliple
FOR(j,n){ //yeni sayları hesapla --> temp
temp[j]=say[j];
if(grid[i][j]=='o') temp[j]--;
else temp[j]++;
}
int curmn=0;
FOR(j,n) curmn+=min(temp[j],n-temp[j]);
if(curmn<mn){
mn=curmn;
FOR(j,n) say[j]=temp[j];
}
}
if(mn<=k) cout<<"DA"<<endl;
else cout<<"NE"<<endl;
}
