#include <bits/stdc++.h>
using namespace std;
const int N = 213;
const int M = 100010;
const int INF = 1 << 30;
pair<int, int> ori, dir[N];
int n, d;
int dp[N * 2][N * 2][3][3];
pair<int, int> getpii() {
  int x, y;
  scanf("%d %d", &x, &y);
  return make_pair(x, y);
}
void init() {
  ori = getpii();
  ori.first += 200;
  ori.second += 200;
  cin >> n >> d;
  d *= d;
  for (int i = 1; i <= n; i++) dir[i] = getpii();
  memset(dp, -1, sizeof(dp));
}
int cnt = 0;
int cal(int x, int y, int ref1, int ref2) {
  if (x > 400 || y > 400) return 1;
  if (dp[x][y][ref1][ref2] != -1) return dp[x][y][ref1][ref2];
  int dist = (x - 200) * (x - 200) + (y - 200) * (y - 200);
  if (dist > d) return dp[x][y][ref1][ref2] = 1;
  for (int i = 1; i <= n; i++) {
    int xx = dir[i].first;
    int yy = dir[i].second;
    if (!cal(xx + x, yy + y, ref2, ref1)) return dp[x][y][ref1][ref2] = 1;
  }
  if (ref1 && !cal(y, x, ref2, 0)) return dp[x][y][ref1][ref2] = 1;
  return dp[x][y][ref1][ref2] = 0;
}
void solve() {
  int res = cal(ori.first, ori.second, 1, 1);
  printf("%s\n", res ? "Anton" : "Dasha");
}
int main() {
  init();
  solve();
}
