#include <bits/stdc++.h>
using namespace std;
int vis[1010][1010], dx[30], dy[30], n, d;
int dfs(int x, int y) {
  if (~vis[x][y]) return vis[x][y];
  if ((x - 200) * (x - 200) + (y - 200) * (y - 200) > d * d)
    return vis[x][y] = 1;
  for (int i = 1; i <= n; i++)
    if (dfs(x + dx[i], y + dy[i]) == 0) return vis[x][y] = 1;
  return vis[x][y] = 0;
}
int main() {
  memset(vis, -1, sizeof(vis));
  int x, y;
  scanf("%d %d %d %d", &x, &y, &n, &d);
  for (int i = 1; i <= n; i++) scanf("%d %d", &dx[i], &dy[i]);
  if (dfs(x + 200, y + 200) == 1)
    printf("Anton");
  else
    printf("Dasha");
  return 0;
}
