#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fi first
#define se second
#define ll long long
#define ld long double
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mpp make_pair
#define ve vector
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
const ll inf = 1e18; const int iinf = 1e9;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> inline bool chmin(T& a, T b) { return (a > b ? a = b, 1 : 0); }
template <typename T> inline bool chmax(T& a, T b) { return (a < b ? a = b, 1 : 0); }
inline void solve() {
int n, k;
cin >> n >> k;
ve<ve<int>> a(n, ve<int> (n));
for (auto &i : a) for (auto &j : i) {
char x;
cin >> x;
j = (x == 'x' ? 1 : 0);
}
int sum = 0;
for (auto &i : a) for (auto &j : i) sum += j;
for (int it = 0; it < 300; ++it) {
for (int i = 0; i < n; ++i) {
int s = 0;
for (int j = 0; j < n; ++j) s += a[i][j];
if (s * 2 > n) for (int j = 0; j < n; ++j) {
sum -= a[i][j];
a[i][j] ^= 1;
sum += a[i][j];
}
}
for (int j = 0; j < n; ++j) {
int s = 0;
for (int i = 0; i < n; ++i) s += a[i][j];
if (s * 2 > n) for (int i = 0; i < n; ++i) {
sum -= a[i][j];
a[i][j] ^= 1;
sum += a[i][j];
}
}
if (sum <= k) return void(cout << "DA");
}
cout << "NE";
}
signed main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int q = 1; // cin >> q;
while (q--) solve();
cerr << fixed << setprecision(3) << "Time execution: " << (double)clock() / CLOCKS_PER_SEC << endl;
}
