#include <bits/stdc++.h>
using namespace std;
pair<int, int> a[146];
bool counted[746][746][2][2];
bool dp[746][746][2][2];
int n, d;
bool countDp(int x, int y, int used1, int used2) {
  if ((x - 200) * (x - 200) + (y - 200) * (y - 200) > d * d) return true;
  if (counted[x][y][used1][used2]) return dp[x][y][used1][used2];
  counted[x][y][used1][used2] = true;
  for (int i = 0; i < n; i++)
    if (!countDp(x + a[i].first, y + a[i].second, used2, used1))
      return dp[x][y][used1][used2] = true;
  if (used1 == 0 && !countDp(y, x, used2, 1))
    return dp[x][y][used1][used2] = true;
  return dp[x][y][used1][used2] = false;
}
int main() {
  int x, y;
  scanf("%d%d%d%d", &x, &y, &n, &d);
  x += 200;
  y += 200;
  for (int i = 0; i < n; i++) scanf("%d%d", &a[i].first, &a[i].second);
  memset(counted, false, sizeof(counted));
  memset(dp, false, sizeof(dp));
  if (countDp(x, y, 0, 0))
    printf("Anton");
  else
    printf("Dasha");
}
