#include <bits/stdc++.h>
using namespace std;

struct Point {
    long double x, y;
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    long double W, H;
    cin >> W >> H; // dimenzije nisu potrebne u rešenju

    int n;
    cin >> n;

    vector<Point> p(n);
    for (int i = 0; i < n; ++i) cin >> p[i].x >> p[i].y;

    const long double PI = acosl(-1.0L);
    const long double TWO_PI = 2.0L * PI;
    const long double EPS = 1e-12L;

    vector<long double> ang;
    ang.reserve(max(0, n - 1));

    for (int i = 0; i + 1 < n; ++i) {
        long double dx = p[i + 1].x - p[i].x;
        long double dy = p[i + 1].y - p[i].y;
        long double a = atan2l(dy, dx);   // [-pi, pi]
        if (a < 0) a += TWO_PI;           // [0, 2pi)
        ang.push_back(a);
    }

    sort(ang.begin(), ang.end());
    int m = (int)ang.size();

    long double bestGap = 0.0L;
    for (int i = 0; i + 1 < m; ++i) {
        bestGap = max(bestGap, ang[i + 1] - ang[i]);
    }
    bestGap = max(bestGap, ang[0] + TWO_PI - ang[m - 1]);

    if (bestGap >= PI - EPS) cout << "DA\n";
    else cout << "NE\n";

    return 0;
}