#include <bits/stdc++.h>
using namespace std;
const int MedN = 200, MaxN = (MedN << 1) + 1;
int f[MaxN][MaxN];
int x[MaxN], y[MaxN];
int d, n, xs, ys;
int g(int xc, int yc) {
  if (((xc) * (xc)) + ((yc) * (yc)) > ((d) * (d))) return 1;
  int& cur = f[xc + MedN][yc + MedN];
  if (cur == 0) {
    int i;
    cur = -1;
    for (i = 0; i < n; i++) cur = max(cur, -g(xc + x[i], yc + y[i]));
  }
  return cur;
}
int main(void) {
  int i;
  while (scanf(" %d %d %d %d", &xs, &ys, &n, &d) != EOF) {
    for (i = 0; i < n; i++) scanf(" %d %d", &x[i], &y[i]);
    memset(f, 0, sizeof(f));
    printf("%s\n", g(xs, ys) == 1 ? "Anton" : "Dasha");
  }
  return 0;
}
