#include <bits/stdc++.h>
using namespace std;
int memo[810][810];
pair<int, int> V[22], O;
int n, d;
bool check(pair<int, int> p) {
  return p.second * p.second + p.first * p.first <= d * d;
}
int solve(int x, int y) {
  int& ret = memo[x + 400][y + 400];
  if (~ret) return ret;
  ret = 0;
  for (int i = 0; i < n; ++i) {
    if (check(make_pair(x + V[i].first, y + V[i].second)))
      ret |= !solve(x + V[i].first, y + V[i].second);
    if (ret) break;
  }
  return ret;
}
int main() {
  scanf("%d %d %d %d", &O.first, &O.second, &n, &d);
  for (int i = 0; i < n; ++i) scanf("%d %d", &V[i].first, &V[i].second);
  memset(memo, -1, sizeof memo);
  if (solve(O.first, O.second))
    printf("Anton\n");
  else
    printf("Dasha\n");
  return 0;
}
