#include <bits/stdc++.h>
using namespace std;
int g[602][602];
set<int> tmp;
vector<pair<int, int> > v;
int x, y, n, d;
int main() {
  cin >> x >> y >> n >> d;
  for (int(i) = 0; (i) < (n); (i)++) {
    int(t1), (t2);
    scanf("%d%d", &(t1), &(t2));
    v.push_back(make_pair(t1, t2));
  }
  for (int i = 601; i >= 0; i--)
    for (int j = 601; j >= 0; j--) {
      tmp.clear();
      if ((i - 200) * (i - 200) + (j - 200) * (j - 200) > d * d) {
        g[i][j] = INT_MAX;
        continue;
      }
      for (typeof((v).begin()) it = (v).begin(); it != (v).end(); it++) {
        int xt = (*it).first, yt = (*it).second;
        if ((xt + i - 200) * (xt + i - 200) + (yt + j - 200) * (yt + j - 200) >
            d * d)
          tmp.insert(INT_MAX);
        else
          tmp.insert(g[xt + i][yt + j]);
      }
      for (int(ip) = 0; (ip) < (22); (ip)++) {
        if (tmp.count(ip) == 0) {
          g[i][j] = ip;
          break;
        }
      }
    }
  if (g[x + 200][y + 200] == 0)
    cout << "Dasha\n";
  else
    cout << "Anton\n";
  return 0;
}
