#include <bits/stdc++.h>
using namespace std;
const int N = 410, H = N / 2;
int x, y, n, d;
int xx[N], yy[N];
int sg[N][N];
bool vis[N][N];
bool out(int a, int b) {
  if (a * a + b * b > d * d) return 1;
  return 0;
}
int dfs(int a, int b) {
  if (out(a, b)) return 1;
  int ta = a + H, tb = b + H;
  if (vis[ta][tb]) return sg[ta][tb];
  vis[ta][tb] = 1;
  set<int> st;
  for (int i = 0; i < n; ++i) {
    st.insert(dfs(a + xx[i], b + yy[i]));
  }
  for (int i = 0;; ++i)
    if (st.find(i) == st.end()) return sg[ta][tb] = i;
}
int main() {
  scanf("%d%d%d%d", &x, &y, &n, &d);
  for (int i = 0; i < n; ++i) scanf("%d%d", xx + i, yy + i);
  int ans = dfs(x, y);
  puts(ans ? "Anton" : "Dasha");
  return 0;
}
