#include <bits/stdc++.h>
using namespace std;
int a[21][2];
int n, d, p1, p2;
int dp[510][510];
template <class T>
inline int sqr(T x) {
  return x * x;
}
bool ok(int r, int c) { return (sqr(r - 200) + sqr(c - 200) <= d * d); }
int dfs(int r, int c) {
  if (dp[r][c] != -1) return dp[r][c];
  dp[r][c] = 0;
  for (int i = 1; i <= n; ++i) {
    if (ok(r + a[i][0], c + a[i][1])) {
      int t = dfs(r + a[i][0], c + a[i][1]);
      if (t == 0) return dp[r][c] = 1;
    }
  }
  return dp[r][c];
}
int main() {
  while (scanf("%d%d%d%d", &p1, &p2, &n, &d) != EOF) {
    memset(dp, -1, sizeof(dp));
    for (int i = 1; i <= n; ++i) scanf("%d%d", &a[i][0], &a[i][1]);
    int res = dfs(p1 + 200, p2 + 200);
    if (res == 1)
      printf("Anton\n");
    else
      printf("Dasha\n");
  }
  return 0;
}
