#include <bits/stdc++.h>
using namespace std;
int n, k, sw, p[2];
int main() {
  cin >> n >> k;
  for (int i = 1, x; i <= n; i++) cin >> x, p[x % 2]++;
  int t1 = (n - k + 1) / 2, t2 = (n - k) / 2;
  if (k == 0)
    sw = 0;
  else if (n == k)
    sw = p[1] % 2;
  else if (t2 >= p[1])
    sw = 0;
  else if (t1 >= p[0] && (p[1] - (t1 - p[0]) - t2) % 2 == 1)
    sw = 1;
  else if (t2 >= p[0] && (p[1] - (t1 - p[0]) - t2) % 2 == 0)
    sw = 0;
  else if (t1 - t2 == 1)
    sw = 1;
  else
    sw = 0;
  if (sw == 0)
    cout << "Daenerys";
  else
    cout << "Stannis";
  return 0;
}
