#include <bits/stdc++.h>
using namespace std;
int X, Y, n, d;
int x[200], y[200];
int sg[500][500];
int solve(int X, int Y) {
  bool flag = 0;
  for (int i = 0; i < n; i++)
    if ((X + x[i] - 200) * (X + x[i] - 200) +
            (Y + y[i] - 200) * (Y + y[i] - 200) <=
        d * d)
      flag = 1;
  if (!flag) return 0;
  int &ret = sg[X][Y];
  if (ret != -1) return ret;
  vector<int> v;
  for (int i = 0; i < n; i++)
    if ((X + x[i] - 200) * (X + x[i] - 200) +
            (Y + y[i] - 200) * (Y + y[i] - 200) <=
        d * d)
      v.push_back(solve(X + x[i], Y + y[i]));
  sort(v.begin(), v.end());
  if (v[0] > 0)
    ret = 0;
  else {
    for (int i = 1; i < v.size(); i++)
      if (v[i] > v[i - 1] + 1) ret = v[i - 1] + 1;
    if (ret == -1) ret = v[v.size() - 1] + 1;
  }
  return ret;
}
int main() {
  cin >> X >> Y >> n >> d;
  for (int i = 0; i < n; i++) cin >> x[i] >> y[i];
  memset(sg, -1, sizeof(sg));
  int ans = solve(X + 200, Y + 200);
  if (ans == 0)
    cout << "Dasha" << endl;
  else
    cout << "Anton" << endl;
  return 0;
}
