#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  cin >> n >> k;
  int cnt[2] = {0};
  int sum = 0;
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    x %= 2;
    cnt[x]++;
    sum += x;
  }
  int neven = cnt[0];
  int nodd = cnt[1];
  k = n - k;
  int goal = 1 - sum % 2;
  int cnt_pre = (k + 1) / 2;
  int cnt_behind = k / 2;
  if (k == 0) {
    if (goal == 0)
      puts("Stannis");
    else
      puts("Daenerys");
  } else if (cnt_pre > cnt_behind) {
    if (neven > cnt_behind && nodd > cnt_behind) {
      puts("Stannis");
    } else {
      int sum;
      if (neven < nodd) {
        sum = k - neven;
      } else {
        sum = nodd;
      }
      if (sum % 2 == goal) {
        puts("Stannis");
      } else {
        puts("Daenerys");
      }
    }
  } else {
    if (neven > cnt_behind && nodd > cnt_behind) {
      puts("Daenerys");
    } else {
      int sum;
      if (neven < nodd) {
        sum = k - neven;
      } else {
        sum = nodd;
      }
      if (sum % 2 == goal) {
        puts("Stannis");
      } else {
        puts("Daenerys");
      }
    }
  }
  return 0;
}
