#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
const int MAXN = 20;
const int MAXDP = 402;
ii start;
int N;
ii moves[MAXN];
int d;
int dp[MAXDP][MAXDP];
bool isWinning(int x, int y) {
  if (x * x + y * y > d * d) {
    return true;
  }
  int& r = dp[x + 200][y + 200];
  if (r == -1) {
    r = false;
    for (int i = 0; i < N; i++) {
      if (!isWinning(x + moves[i].first, y + moves[i].second)) {
        r = true;
        break;
      }
    }
  }
  assert(r == 0 || r == 1);
  return r;
}
int main() {
  for (int i = 0; i < MAXDP; i++) {
    for (int j = 0; j < MAXDP; j++) {
      dp[i][j] = -1;
    }
  }
  cin >> start.first >> start.second >> N >> d;
  for (int i = 0; i < N; i++) {
    cin >> moves[i].first >> moves[i].second;
  }
  cout << (isWinning(start.first, start.second) ? "Anton" : "Dasha") << '\n';
}
