#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > v;
int dp[805][805][3][3];
int n, xo, yo;
double d;
bool dd(int x, int y) {
  double di =
      sqrt(((x - 200) * (x - 200) * 1.000) + ((y - 200) * (y - 200) * 1.000));
  if (di > d)
    return true;
  else
    return false;
}
int dfs(int x, int y, bool pow1, bool pow2) {
  if (dp[x][y][pow1][pow2] != -1) return dp[x][y][pow1][pow2];
  if (dd(x, y)) return dp[x][y][pow1][pow2] = 0;
  int xn, yn;
  bool flag = false;
  for (long long(i) = (0); (i) < (n); (i)++) {
    xn = x + v[i].first;
    yn = y + v[i].second;
    flag = flag | dfs(xn, yn, pow2, pow1);
    if (pow1) flag = flag | dfs(y, x, pow2, !pow1);
  }
  if (flag)
    dp[x][y][pow1][pow2] = 0;
  else
    dp[x][y][pow1][pow2] = 1;
  return dp[x][y][pow1][pow2];
}
int main() {
  int x, y, a, b, resp;
  cin >> xo >> yo >> n >> d;
  xo += 200;
  yo += 200;
  x = xo;
  y = yo;
  for (long long(i) = (0); (i) < (n); (i)++) {
    cin >> a >> b;
    v.push_back((make_pair((a), (b))));
  }
  memset(dp, -1, sizeof(dp));
  resp = dfs(x, y, true, true);
  if (resp == 1)
    cout << "Dasha" << endl;
  else
    cout << "Anton" << endl;
  return 0;
}
