#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f, maxn = 1005;
int n, d, x[maxn], y[maxn], dp[maxn][maxn];
int dfs(int X, int Y) {
  if ((X - 200) * (X - 200) + (Y - 200) * (Y - 200) > d * d) return 1;
  if (~dp[X][Y]) return dp[X][Y];
  int sg = 0;
  for (int i = 1; i <= n; i++) sg |= !dfs(X + x[i], Y + y[i]);
  return dp[X][Y] = sg;
}
int main() {
  scanf("%d%d%d%d", &x[0], &y[0], &n, &d);
  for (int i = 1; i <= n; i++) scanf("%d%d", &x[i], &y[i]);
  memset(dp, -1, sizeof(dp));
  printf("%s\n", dfs(x[0] + 200, y[0] + 200) ? "Anton" : "Dasha");
  return 0;
}
