#include <bits/stdc++.h>
using namespace std;
int x, y, n, d, dx[20], dy[20];
map<pair<int, int>, bool> mem;
bool gao(int x, int y) {
  if (mem.count(pair<int, int>(x, y))) return mem[pair<int, int>(x, y)];
  if (x * x + y * y > d * d) return mem[pair<int, int>(x, y)] = true;
  for (int i = 0; i < n; i++)
    if (!gao(x + dx[i], y + dy[i])) return mem[pair<int, int>(x, y)] = true;
  return mem[pair<int, int>(x, y)] = false;
}
int main() {
  scanf("%d%d%d%d", &x, &y, &n, &d);
  for (int i = 0; i < n; i++) scanf("%d%d", &dx[i], &dy[i]);
  puts(gao(x, y) ? "Anton" : "Dasha");
}
