1from collections import deque
 2N, L = map(int, input().split())
 3A = list(map(int, input().split()))
 4
 5Q = deque([(A[0], 0)])
 6result = [A[0]]
 7
 8for i in range(1, N):
 9if Q[0][1] == i-L:
10Q.popleft()
11while Q and Q[-1][0] >= A[i]:
12Q.pop()
13Q.append((A[i], i))
14result.append(Q[0][0])
15
16print(*result)

 1N = int(input())
 2M = int(input())
 3
 4parent = [i for i in range(N)]
 5
 6def find(node):
 7    if parent[node] != node:
 8        parent[node] = find(parent[node])
 9    return parent[node]
10
11def union(a, b):
12    a = find(a)
13    b = find(b)
14    if a < b:
15        parent[b] = a
16    else:
17        parent[a] = b
18
19for i in range(N):
20    for j, item in enumerate(map(int, input().split())):
21        if item:
22            union(i, j)
23
24path = list(map(int, input().split()))
25start = parent[path[0]-1]
26for i in range(1, M):
27    if parent[path[i]-1] != start:
28        print("NO")
29        break
30else:
31    print('YES')

 1def multiply(m1, m2):
 2    result = [0, 0, 0, 0]
 3    result[0] = (m1[0]*m2[0] + m1[1]*m2[2]) % 1000000007
 4    result[1] = (m1[0]*m2[1] + m1[1]*m2[3]) % 1000000007
 5    result[2] = (m1[2]*m2[0] + m1[3]*m2[2]) % 1000000007
 6    result[3] = (m1[2]*m2[1] + m1[3]*m2[3]) % 1000000007
 7    return result
 8
 9def power(m, n):
10    if (n > 1):
11        m = power (m, n//2)
12
13        m = multiply (m, m)
14        if n % 2 == 1:
15            m = multiply(m, [1,1,1,0])
16    return m
17
18N = int(input())
19
20mat = power ([1,1,1,0], N)
21print (mat[1]%1000000007)

 1from collections import deque
 2
 3dx = [0, 0, -1, 1]
 4dy = [-1, 1, 0, 0]
 5
 6N, M = map(int, input().split())
 7L = [list(map(int, input().split())) for _ in range(N)]
 8
 9def check():
10    q = deque()
11    q.append((0, 0))
12
13    visited = [[0]*M for _ in range(N)]
14    visited[0][0] = 1
15
16    while q:
17        curX, curY = q.popleft()
18
19        for i in range(4):
20            nX = curX + dx[i]
21            nY = curY + dy[i]
22
23            if 0 <= nX < N and 0 <= nY < M:
24                if L[nX][nY] == 0 and visited[nX][nY] == 0:
25                    q.append((nX, nY))
26                    visited[nX][nY] = 1
27                elif L[nX][nY] == 1:
28                    visited[nX][nY] += 1
29    melted = []
30    for i in range(N):
31        for j in range(M):
32            if visited[i][j] >= 2:
33                melted.append((i, j))
34
35    return melted
36
37result = 0
38
39while True:
40    isAnyCheese = False
41
42    melted = check()
43
44    if not melted:
45        break
46
47    for x, y in melted:
48        L[x][y] = 0
49
50    result += 1
51
52print (result)

 1import heapq
 2
 3N = int(input())
 4
 5L = []
 6for _ in range(N):
 7    L.append(tuple(map(int, input().split())))
 8
 9L.sort()
10q = []
11
12heapq.heappush(q, L[0][1])
13for i in L[1:]:
14    if q[0] > i[0]:
15        heapq.heappush(q, i[1])
16    else:
17        heapq.heappop(q)
18        heapq.heappush(q, i[1])
19
20print (len(q))

 1def minion_game(string):
 2    stuart = 0
 3    kevin = 0
 4    
 5    for i in range(len(string)):
 6        for j in range(i+1, len(string)+1):
 7            if string[i] in ['A', 'E', 'I', 'O', 'U']:
 8                kevin += 1
 9            else:
10                stuart += 1
11    
12    if stuart > kevin:
13        print ('Stuart', stuart)
14    elif stuart < kevin:
15        print ('Kevin', kevin)
16    else:
17        print ('Draw')

1def merge_the_tools(string, k):
2  for i in range(0, len(string), k):
3    temp = []
4    for j in range(i, i+k):
5      if not string[j] in temp:
6        temp.append(string[j])
7    print (''.join(temp))

 1from datetime import datetime
 2
 3def time_delta(t1, t2):
 4
 5    DATE_FORMAT = '%a %d %b %Y %H:%M:%S %z'
 6
 7    start = datetime.strptime(t1, DATE_FORMAT)
 8    end = datetime.strptime(t2, DATE_FORMAT)
 9
10    return str(int(abs(start-end).total_seconds()))