#include <bits/stdc++.h>
using namespace std;
template <class C>
void mini(C& a4, C b4) {
  a4 = min(a4, b4);
}
template <class C>
void maxi(C& a4, C b4) {
  a4 = max(a4, b4);
}
template <class T1, class T2>
ostream& operator<<(ostream& out, pair<T1, T2> pair) {
  return out << "(" << pair.first << ", " << pair.second << ")";
}
template <class A, class B, class C>
struct Triple {
  A first;
  B second;
  C third;
  bool operator<(const Triple& t) const {
    if (first != t.first) return first < t.first;
    if (second != t.second) return second < t.second;
    return third < t.third;
  }
};
template <class T>
void ResizeVec(T&, vector<long long>) {}
template <class T>
void ResizeVec(vector<T>& vec, vector<long long> sz) {
  vec.resize(sz[0]);
  sz.erase(sz.begin());
  if (sz.empty()) {
    return;
  }
  for (T& v : vec) {
    ResizeVec(v, sz);
  }
}
template <class A, class B, class C>
ostream& operator<<(ostream& out, Triple<A, B, C> t) {
  return out << "(" << t.first << ", " << t.second << ", " << t.third << ")";
}
void W(long long a) {
  if (a == 1) {
    cout << "Stannis\n";
  } else {
    cout << "Daenerys\n";
  }
  exit(0);
}
int main() {
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(10);
  if (0) cout << fixed << setprecision(10);
  cin.tie(0);
  double beg_clock = 1.0 * clock() / CLOCKS_PER_SEC;
  long long n, k;
  cin >> n >> k;
  ;
  long long npar = 0;
  for (long long i = (1); i <= (n); ++i) {
    long long a;
    cin >> a;
    ;
    npar += a % 2;
  }
  if (n == k) {
    W(npar % 2);
  }
  long long fir_last = (n - k) % 2;
  long long full = (n - k) / 2;
  if (npar <= full) {
    W(2);
  }
  if (n - npar <= full) {
    W(k % 2);
  }
  W(fir_last);
  return 0;
}
