#include <bits/stdc++.h>
using namespace std;
pair<int, int> vec[200];
int dp[1000][1000];
int n, d;
int isWin(pair<int, int> pos) {
  if (dp[pos.first + 500][pos.second + 500] != -1)
    return dp[pos.first + 500][pos.second + 500];
  if (pos.first * pos.first + pos.second * pos.second > d * d)
    return dp[pos.first + 500][pos.second + 500] = 1;
  for (int i = 0; i < n; i++) {
    if (!isWin(pair<int, int>(pos.first + vec[i].first,
                              pos.second + vec[i].second)))
      return dp[pos.first + 500][pos.second + 500] = 1;
  }
  return dp[pos.first + 500][pos.second + 500] = 0;
}
int main() {
  int x, y;
  memset(dp, -1, sizeof(dp));
  scanf("%d %d %d %d", &x, &y, &n, &d);
  for (int i = 0; i < n; i++) {
    scanf("%d %d", &vec[i].first, &vec[i].second);
  }
  printf("%s\n", isWin(pair<int, int>(x, y)) ? "Anton" : "Dasha");
  return 0;
}
