Pagini recente » Cod sursa (job #2962134) | Cod sursa (job #2673008) | Cod sursa (job #421234) | Cod sursa (job #823626) | Cod sursa (job #2449959)
#include <iostream>
#include <cstdio>
#include <vector>
#include <fstream>
#include <string>
#include <algorithm>
using namespace std;
void solve()
{
int n, m, x, y;
scanf("%d %d %d %d\n", &n, &m, &x, &y);
if (min(n - x, x - 1) <= 2 || min(m - y, y - 1) <= 2)
printf("DA\n");
else
printf("NU\n");
}
int main()
{
freopen("chatnoir.in", "r", stdin);
freopen("chatnoir.out", "w", stdout);
int t;
scanf("%d", &t);
for (int i = 0; i < t; ++i)
solve();
return 0;
}