#include <bits/stdc++.h>
using namespace std;
int n, k, in;
int memo[200005][2][2];
bool solve(int e, int o, bool t) {
  if (e + o == k) {
    if (o & 1) return 1;
    return 0;
  }
  int &ret = memo[e + o][t][o & 1];
  if (ret != -1) return ret;
  ret = 0;
  if (t) {
    if (e) ret |= solve(e - 1, o, 0);
    if (o) ret |= solve(e, o - 1, 0);
  } else {
    if (e) ret |= !solve(e - 1, o, 1);
    if (o) ret |= !solve(e, o - 1, 1);
  }
  return ret;
}
int main() {
  int odd = 0, even = 0;
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; i++) {
    scanf("%d", &in);
    if (in & 1)
      odd++;
    else
      even++;
  }
  if (k == n) {
    if (odd & 1)
      puts("Stannis");
    else
      puts("Daenerys");
    return 0;
  }
  int ng = n - k;
  int sg = (ng + 1) / 2;
  int dg = ng / 2;
  if (sg < even) {
    if (sg != dg) {
      if (dg < odd) {
        puts("Stannis");
      } else {
        puts("Daenerys");
      }
    } else {
      puts("Daenerys");
    }
  } else if (sg == even) {
    if (sg != dg) {
      puts("Stannis");
    } else {
      int rem = odd - dg;
      if (rem & 1)
        puts("Stannis");
      else
        puts("Daenerys");
    }
  } else {
    int rem = odd - dg - (sg - even);
    if (rem & 1)
      puts("Stannis");
    else
      puts("Daenerys");
  }
}
