#include <bits/stdc++.h>
#pragma warning(disable : 4996)
#pragma comment(linker, "/STACK:666000000")
using namespace std;
const int inf = (1 << 30) - 1;
const long double eps = 1e-9;
const long double pi = fabs(atan2(0.0, -1.0));
void ML(const bool v) {
  if (v) return;
  int *ass;
  for (;;) {
    ass = new int[2500000];
    for (int i = 0; i < 2500000; i++) ass[i] = rand();
  }
}
void TL(const bool v) {
  if (v) return;
  int *ass;
  ass = new int[250];
  for (;;) {
    for (int i = 0; i < 250; i++) ass[i] = rand();
  }
}
void PE(const bool v) {
  if (v) return;
  puts("ass 1 2 3 4 5 6 fuck");
  exit(0);
}
int xo, yo, d, n;
int dx[25], dy[25];
void LoAd() {
  scanf("%d%d%d%d", &xo, &yo, &n, &d);
  for (int i = 0; i < n; i++) scanf("%d%d", &dx[i], &dy[i]);
}
int sv[444][444][2][2];
int go(const int x, const int y, const int now, const int not_now) {
  if (((x) * (x)) + ((y) * (y)) > d) return 0;
  int &res = sv[x + 222][y + 222][now][not_now];
  if (-1 != res) return res;
  if (0 == now) res = go(y, x, not_now, 1);
  for (int i = 0; i < n; i++)
    res = max(res, go(x + dx[i], y + dy[i], not_now, now));
  res ^= 1;
  return res;
}
void SoLvE() {
  memset(sv, -1, sizeof(sv));
  d = ((d) * (d));
  if (0 == go(xo, yo, 0, 0))
    puts("Anton");
  else
    puts("Dasha");
}
int main() {
  srand((int)time(NULL));
  LoAd();
  SoLvE();
  return 0;
}
