#include <bits/stdc++.h>
using namespace std;
void solve();
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed;
  cout.precision(12);
  solve();
  return 0;
}
template <typename T>
void prv(vector<T> v) {
  for (int __ii = 0; __ii < ((int)v.size()); __ii++) {
    if (__ii) cout << ' ';
    cout << v[__ii];
  }
  cout << '\n';
}
template <typename T>
void prm(vector<vector<T>> v) {
  for (int __ii = 0; __ii < ((int)v.size()); __ii++) {
    for (int __jj = 0; __jj < v[__ii].size(); __jj++) {
      if (__jj) cout << ' ';
      cout << v[__ii][__jj];
    }
    cout << '\n';
  }
}
template <typename T>
void sc(T& x) {
  cin >> x;
}
template <typename Head, typename... Tail>
void sc(Head& head, Tail&... tail) {
  cin >> head;
  sc(tail...);
}
template <typename T>
void pr(const T& x) {
  cout << x << '\n';
}
template <typename Head, typename... Tail>
void pr(const Head& head, const Tail&... tail) {
  cout << head << ' ';
  pr(tail...);
}
template <typename... T>
void err(const T&... cod) {
  pr(cod...);
  exit(0);
}
const int N = 505;
int dp[N][N], dx[N], dy[N];
int x, y, n, d;
int dfs(int curx, int cury) {
  if ((curx - 200) * (curx - 200) + (cury - 200) * (cury - 200) >= d * d)
    return 1;
  if (dp[curx][cury] != -1) return dp[curx][cury];
  int win = 0;
  for (int i = 0; i < n; i++) win |= !dfs(curx + dx[i], cury + dy[i]);
  return dp[curx][cury] = win;
}
void solve() {
  cin >> x >> y >> n >> d;
  x += 200;
  y += 200;
  memset(dp, -1, sizeof dp);
  for (int i = 0; i < n; i++) cin >> dx[i] >> dy[i];
  pr(dfs(x, y) ? "Anton" : "Dasha");
}
