#include <bits/stdc++.h>
using namespace std;
int X[22], Y[22], x, y, n, d;
map<pair<int, int>, int> M;
int gogo(pair<int, int> P) {
  if (M.find(P) != M.end()) return M[P];
  for (int i = 0; i < n; i++) {
    if ((P.first + X[i]) * (P.first + X[i]) +
            (P.second + Y[i]) * (P.second + Y[i]) >
        d * d)
      continue;
    if (gogo(make_pair(P.first + X[i], P.second + Y[i])) == 0) return M[P] = 1;
  }
  return M[P] = 0;
}
int main() {
  scanf("%d%d%d%d", &x, &y, &n, &d);
  for (int i = 0; i < n; i++) scanf("%d%d", &X[i], &Y[i]);
  gogo(make_pair(x, y)) ? puts("Anton") : puts("Dasha");
  return 0;
}
