#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5, mod = 1e9 + 7;
int grundy[2000][2000], dr[50], dc[50];
int x, y, n, d;
bool valid(int x, int y) { return x * x + y * y <= d * d; }
int mex(set<int> &st) {
  int ret = 0;
  while (st.count(ret)) ret++;
  return ret;
}
int solve(int x, int y) {
  if (grundy[x][y] != -1) return grundy[x][y];
  set<int> st;
  for (int i = 0; i < n; i++) {
    int nx, ny;
    nx = x + dr[i];
    ny = y + dc[i];
    if (valid(nx - 200, ny - 200)) {
      st.insert(solve(nx, ny));
    }
  }
  return grundy[x][y] = mex(st);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  memset(grundy, -1, sizeof grundy);
  cin >> x >> y >> n >> d;
  for (int i = 0; i < n; i++) {
    cin >> dr[i] >> dc[i];
  }
  if (solve(x + 200, y + 200))
    cout << "Anton";
  else
    cout << "Dasha";
  return 0;
}
