#include <bits/stdc++.h>
using namespace std;
const int N = 2000;
const int maxn = 1e3 + 10;
const int maxm = 1e6 + 10;
const int MOD = 1e9 + 7;
int dp[maxn][maxn];
struct Point {
  int x, y;
} p[maxn];
int n, d;
int dfs(int x, int y) {
  if (dp[x][y] != -1) return dp[x][y];
  if ((x - 200) * (x - 200) + (y - 200) * (y - 200) >= d * d) return 1;
  for (int i = 0; i < n; i++)
    if (dfs(x + p[i].x, y + p[i].y) == 0) return dp[x][y] = 1;
  return dp[x][y] = 0;
}
int main() {
  ios_base::sync_with_stdio(0);
  int x, y;
  while (cin >> x >> y >> n >> d) {
    memset(dp, -1, sizeof(dp));
    for (int i = 0; i < n; i++) cin >> p[i].x >> p[i].y;
    if (dfs(x + 200, y + 200))
      cout << "Anton" << endl;
    else
      cout << "Dasha" << endl;
  }
  return 0;
}
