#include <bits/stdc++.h>
using namespace std;
int X, Y, n, d, x[25], y[25], g[2][2][600][600];
int sg(int z1, int z2, int X, int Y) {
  if (g[z1][z2][X][Y] == -1) {
    bool b[100];
    for (int i = 0; i < 100; i++) {
      b[i] = true;
    }
    for (int i = 0; i < n; i++) {
      if ((X + x[i] - 300) * (X + x[i] - 300) +
              (Y + y[i] - 300) * (Y + y[i] - 300) <=
          d * d) {
        b[sg(z2, z1, X + x[i], Y + y[i])] = false;
      }
    }
    if (z1) {
      b[sg(z2, 0, Y, X)] = false;
    }
    for (int i = 0;; i++) {
      if (b[i]) {
        g[z1][z2][X][Y] = i;
        break;
      }
    }
  }
  return g[z1][z2][X][Y];
}
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]);
  }
  for (int i = 0; i < 2; i++) {
    for (int j = 0; j < 2; j++) {
      for (int k = 0; k < 600; k++) {
        for (int l = 0; l < 600; l++) {
          g[i][j][k][l] = -1;
        }
      }
    }
  }
  if (sg(1, 1, X + 300, Y + 300)) {
    printf("Anton\n");
  } else {
    printf("Dasha\n");
  }
  return 0;
}
