#include <bits/stdc++.h>
using namespace std;
const int inf = 1000 * 1000 * 1000;
int x, y, d, n;
char dp[450][450][2][2][2];
int ar[25][2];
int DP(int x, int y, int q, int a, int b) {
  if (x * x + y * y > d * d) return 1;
  if (dp[x + 200][y + 200][q][a][b] != -1) return dp[x + 200][y + 200][q][a][b];
  int ok = 1;
  for (int i = 0; i < n; i++) {
    ok = min(ok, DP(x + ar[i][0], y + ar[i][1], !q, a, b));
  }
  if (!q && !a) {
    ok = min(ok, DP(y, x, !q, 1, b));
  }
  if (q && !b) {
    ok = min(ok, DP(y, x, !q, a, 1));
  }
  dp[x + 200][y + 200][q][a][b] = !ok;
  return dp[x + 200][y + 200][q][a][b];
}
int main() {
  memset(dp, -1, sizeof(dp));
  ;
  scanf("%d%d%d%d", &x, &y, &n, &d);
  for (int i = 0; i < n; i++) scanf("%d%d", &ar[i][0], &ar[i][1]);
  int t = DP(x, y, 0, 0, 0);
  if (t)
    printf("Anton");
  else
    printf("Dasha");
  return 0;
}
