#include <bits/stdc++.h>   using namespace std;   int cnt[2];   int main() {     int n, k, m;     scanf( %d%d , &n, &k);     for (int i = 0; i < n; i++) {       scanf( %d , &m);       cnt[m % 2]++;     }     int r = n - k;     if (r == 0) {       if (cnt[1] % 2 == 1)         puts( Stannis );       else         puts( Daenerys );       return 0;     }     int sec = r / 2;     int fst = r - sec;     if (fst >= cnt[0] && k % 2 == 1) {       puts( Stannis );       return 0;     }     if (sec >= cnt[1]) {       puts( Daenerys );       return 0;     }     if (sec >= cnt[0] && k % 2 == 0) {       puts( Daenerys );       return 0;     }     if (r % 2 == 0) {       puts( Daenerys );       return 0;     }     puts( Stannis );     return 0;   }   