#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > v;
int dp[401][401][2];
int x, y, n, d;
double dist(int i, int j) {
  i -= 200;
  j -= 200;
  return sqrt(i * i + j * j);
}
int solve(int i, int j, int p) {
  if (dist(i, j) > d) return 0;
  int &ret = dp[i][j][p];
  if (ret != -1) return ret;
  ret = 0;
  int tmp = 0;
  for (auto pp : v) {
    tmp += solve(i + pp.first, j + pp.second, !p);
  }
  if (!tmp)
    ret = 1;
  else
    ret = 0;
  return ret;
}
int main() {
  cin >> x >> y >> n >> d;
  int xx, yy;
  memset(dp, -1, sizeof dp);
  for (int i = 0; i < n; i++) {
    cin >> xx >> yy;
    v.push_back({xx, yy});
  }
  int r = solve(x + 200, y + 200, 0);
  puts(!r ? "Anton" : "Dasha");
}
