#include <bits/stdc++.h>
using namespace std;
int x0, y0__, n, d;
int f[411][411][2][2][2];
int x[22], y[22];
int get(int x0, int y0__, int turn, int c0, int c1) {
  if (f[x0 + 200][y0__ + 200][turn][c0][c1] >= 0)
    return f[x0 + 200][y0__ + 200][turn][c0][c1];
  int& res = f[x0 + 200][y0__ + 200][turn][c0][c1];
  if (turn == 0) {
    if (c0 == 0) {
      if (get(y0__, x0, 1 - turn, 1, c1) == 0) return res = 0;
    }
    for (int i = (1), _b = (n); i <= _b; i++) {
      if (((x0 + x[i]) * (x0 + x[i])) + ((y0__ + y[i]) * (y0__ + y[i])) <=
          d * d)
        if (get(x0 + x[i], y0__ + y[i], 1 - turn, c0, c1) == 0) return res = 0;
    }
    return res = 1;
  } else {
    if (c1 == 0) {
      if (get(y0__, x0, 1 - turn, c0, 1) == 1) return res = 1;
    }
    for (int i = (1), _b = (n); i <= _b; i++) {
      if (((x0 + x[i]) * (x0 + x[i])) + ((y0__ + y[i]) * (y0__ + y[i])) <=
          d * d)
        if (get(x0 + x[i], y0__ + y[i], 1 - turn, c0, c1) == 1) return res = 1;
    }
    return res = 0;
  }
}
int main() {
  ios ::sync_with_stdio(false);
  while (cin >> x0 >> y0__ >> n >> d) {
    memset(f, -1, sizeof f);
    for (int i = (1), _b = (n); i <= _b; i++) cin >> x[i] >> y[i];
    cout << (get(x0, y0__, 0, 0, 0) == 0 ? "Anton" : "Dasha") << endl;
  }
}
