#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +1005
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;
int a[N][N], i, j, n, k, p;
int main()
{
srand(time(0));
ios_base::sync_with_stdio(0);
iostream::sync_with_stdio(0);
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
// in("input.txt");
// out("output.txt");
cin >> n >> k;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
{
char c;
cin >> c;
a[i][j] = (c == 'x') ? 1 : 0;
}
for (p = 1; p <= n; p++)
{
for (i = 1; i <= n; i++)
{
int kol = 0;
for (j = 1; j <= n; j++) if (a[i][j] == 0) kol++;
if (2 * kol > n)
for (j = 1; j <= n; j++) a[i][j] = a[i][j] ^ 1;
}
for (j = 1; j <= n; j++)
{
int kol = 0;
for (i = 1; i <= n; i++) if (a[i][j] == 0) kol++;
if (2 * kol > n)
for (i = 1; i <= n; i++) a[i][j] = a[i][j] ^ 1;
}
int kol = 0;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++) kol += a[i][j];
if (n - kol <= k)
{
cout << "DA";
return 0;
}
}
cout << "NE";
}
