#include <bits/stdc++.h>
void dbg(const char* fmt, ...) {}
int solve() {
  int n, k;
  scanf("%d%d", &n, &k);
  int even = 0;
  for (int i = 0; i < n; i++) {
    int x;
    scanf("%d", &x);
    if (x % 2 == 0) even++;
  }
  int odd = n - even;
  int second_moves = (n - k) / 2;
  int first_moves = n - k - second_moves;
  if (first_moves == 0) {
    return odd % 2;
  }
  if (n % 2 == 0) {
    if (k % 2 == 0) {
      return 0;
    } else {
      return second_moves < odd;
    }
  } else {
    if (k % 2 == 0) {
      return second_moves < std::min(odd, even);
    } else {
      return !(first_moves < even);
    }
  }
}
int main() {
  printf("%s\n", solve() ? "Stannis" : "Daenerys");
  return 0;
}
