#include <bits/stdc++.h>
using namespace std;
const int MAX = 1000;
int dp[MAX][MAX];
int x[100], y[100], n, d;
int i, xx, yy;
int dfs(int i, int j) {
  if (((i - 200) * (i - 200) + (j - 200) * (j - 200)) > d * d) return 1;
  if (dp[i][j] >= 0) return dp[i][j];
  for (int k = 0; k < n; k++) {
    int _x = i + x[k], _y = j + y[k];
    if (!dfs(_x, _y)) return dp[i][j] = 1;
  }
  return dp[i][j] = 0;
}
int main() {
  cin >> xx >> yy >> n >> d;
  for (i = 0; i < n; i++) cin >> x[i] >> y[i];
  xx += 200;
  yy += 200;
  memset(dp, -1, sizeof(dp));
  if (dfs(xx, yy) == 1)
    cout << "Anton";
  else
    cout << "Dasha";
  cout << "\n";
}
