#include <bits/stdc++.h>
const int N = 20 + 2;
const int X = 400 + 2;
int n, d, sx, sy, a[N], b[N], f[X][X];
int F(int x, int y) {
  if (x * x + y * y > d * d) return 1;
  int &state = f[x + 200][y + 200];
  if (state) return state - 1;
  state = 1;
  for (int i = 0; i < n; ++i)
    if (F(x + a[i], y + b[i]) == 0) state = 2;
  return state - 1;
}
int main() {
  scanf("%d %d %d %d", &sx, &sy, &n, &d);
  for (int i = 0; i < n; ++i) scanf("%d %d", &a[i], &b[i]);
  printf(F(sx, sy) == 1 ? "Anton" : "Dasha");
  return 0;
}
