#include <bits/stdc++.h>
using namespace std;
const double PI = 2 * asin(1.0);
const long long mod = 1e9 + 7;
const double EPS = 1e-10;
inline int cmp(double x, double y = 0, double tol = EPS) {
  return (x <= y + tol) ? (x + tol < y) ? -1 : 0 : 1;
}
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  int P = 0, I = 0;
  for (int i = 0; i < n; ++i) {
    int aux;
    scanf("%d", &aux);
    aux % 2 == 0 ? P++ : I++;
  }
  int d = (n - k) / 2;
  int s = (n - k) - d;
  if (n == k) {
    if (I % 2 == 0)
      cout << "Daenerys\n";
    else
      cout << "Stannis\n";
  } else if (d >= I)
    cout << "Daenerys\n";
  else {
    if ((n - k) % 2 == 1) {
      if (k % 2 == 1)
        cout << "Stannis\n";
      else {
        if (d >= P)
          cout << "Daenerys\n";
        else
          cout << "Stannis\n";
      }
    } else {
      if (k % 2 == 0)
        cout << "Daenerys\n";
      else {
        if (s >= P)
          cout << "Stannis\n";
        else
          cout << "Daenerys\n";
      }
    }
  }
}
