#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const int N = 405;
int x, y, n, d, a[25][2], memo[N][N];
bool check(int i, int j) { return i * i + j * j <= d * d; }
int solve(int i, int j) {
  int &ans = memo[i + 200][j + 200];
  if (~ans) return ans;
  set<int> st;
  for (int k = 0; k < n; k++)
    if (check(i + a[k][0], j + a[k][1]))
      st.insert(solve(i + a[k][0], j + a[k][1]));
  int mex = 0;
  while (st.count(mex)) mex++;
  return ans = mex;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> x >> y >> n >> d;
  for (int i = 0; i < n; i++) cin >> a[i][0] >> a[i][1];
  memset(memo, -1, sizeof memo);
  cout << (solve(x, y) ? "Anton" : "Dasha");
  return 0;
}
