There are *n* cities in Westeros. The *i*-th city is inhabited by *a*<sub class="lower-index">*i*</sub> people. Daenerys and Stannis play the following game: in one single move, a player chooses a certain town and burns it to the ground. Thus all its residents, sadly, die. Stannis starts the game. The game ends when Westeros has exactly *k* cities left.

The prophecy says that if the total number of surviving residents is even, then Daenerys wins: Stannis gets beheaded, and Daenerys rises on the Iron Throne. If the total number of surviving residents is odd, Stannis wins and everything goes in the completely opposite way.

Lord Petyr Baelish wants to know which candidates to the throne he should support, and therefore he wonders, which one of them has a winning strategy. Answer to this question of Lord Baelish and maybe you will become the next Lord of Harrenholl.
The first line contains two positive space-separated integers, *n* and *k* (1 ≤ *k* ≤ *n* ≤ 2·10<sup class="upper-index">5</sup>) — the initial number of cities in Westeros and the number of cities at which the game ends. 

The second line contains *n* space-separated positive integers *a*<sub class="lower-index">*i*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">6</sup>), which represent the population of each city in Westeros.
import sys
sys.setrecursionlimit(100000)
BAK = dict()
def gen(n, k, i, odd, even):
    # true if St false if Deny
    #print(i,(odd,even))
    if (i,odd) in BAK:
        return BAK[(i,odd)]
    if i == n - k:
        if odd % 2 == 0:
            BAK[(i,odd)]="DENY"
            #return "DENY"
        else:
            BAK[(i,odd)]= "STAN"
    elif i % 2 == 1:  # STannis
        if "DENY" in [BAK.get((i+1,odd-1)),BAK.get((i+1,odd))] or (odd > 0 and gen(n, k, i + 1, odd - 1, even) == "DENY") or (
                        even > 0 and "DENY" == gen(n, k, i + 1, odd, even - 1)):
            BAK[(i,odd)]= "DENY"
        else:
            BAK[(i,odd)]= "STAN"
    else:
        if "STAN" in [BAK.get((i+1,odd-1)),BAK.get((i+1,odd))] or  (odd > 0 and gen(n, k, i + 1, odd - 1, even) == "STAN") or (
                        even > 0 and "STAN" == gen(n, k, i + 1, odd, even - 1)):
            BAK[(i,odd)] = "STAN"
        else:
            BAK[(i,odd)] =  "DENY"
    return BAK[(i,odd)]

n, k = map(int, input().split())
nums = list(map(lambda x: int(x) % 2, input().split()))
odd = nums.count(1)
even = n - odd
print("Stannis" if "STAN"==gen(n, k, 0, odd, even) else "Daenerys")
