import sys

def solve():
    # 讀取所有輸入
    input_data = sys.stdin.read().split()
    if not input_data:
        return
    
    F = int(input_data[0])
    N = int(input_data[1])
    y = [int(x) for x in input_data[2:2+N]]
    
    bro_moves = []
    
    # 判斷輸贏的輔助函式
    def check_win(bro, sis):
        if bro == sis:
            return 0
        if (bro == 0 and sis == 2) or (bro == 2 and sis == 5) or (bro == 5 and sis == 0):
            return 1  # 哥哥贏
        return -1  # 妹妹贏

    # 決定反制拳法的輔助函式
    def counter_move(move):
        if move == 0: return 5
        if move == 2: return 0
        return 2

    for i in range(N):
        if i == 0:
            bro_current = F
        elif i >= 2 and y[i-1] == y[i-2]:
            bro_current = counter_move(y[i-1])
        else:
            bro_current = y[i-1]
            
        bro_moves.append(bro_current)
        
        # 檢查本回合勝負
        result = check_win(bro_current, y[i])
        if result != 0:
            # 輸出哥哥出拳歷程與結果
            print(*(bro_moves), end="")
            if result == 1:
                print(f" : Won at round {i + 1}")
            else:
                print(f" : Lost at round {i + 1}")
            return

    # 若全數平手
    print(*(bro_moves), end="")
    print(f" : Drew at round {N}")

if __name__ == "__main__":
    solve()