#include <bits/stdc++.h>
using namespace std;
const int INF = (int)1.01e9;
const int maxN = 222;
int dp[2 * maxN][2 * maxN];
vector<pair<int, int> > b;
int d;
int solve(int x, int y) {
  if ((x - maxN) * (x - maxN) + (y - maxN) * (y - maxN) > d * d) {
    return 1;
  }
  if (!dp[x][y]) {
    for (auto v : b) {
      dp[x][y] |= !solve(v.first + x, v.second + y);
    }
    dp[x][y]++;
  }
  return dp[x][y] - 1;
}
int main() {
  int x, y, n;
  cin >> x >> y >> n >> d;
  b.resize(n);
  for (int i = 0; i < n; i++) {
    cin >> b[i].first >> b[i].second;
  }
  cout << (solve(x + maxN, y + maxN) ? "Anton" : "Dasha") << endl;
  return 0;
}
