Башня

def push(stack, elem):
    stack.append(elem)
    return elem
def top(stack):
    return stack[-1]
def pop(stack):
    return stack.pop()
def size(stack):
    return len(stack)
def power(a, n):
    if n == 0:
        return 1
    elif n % 2 == 0:
        return power(a * a, n // 2)
    else:
        return power(a, n - 1) * a
inf = 2 * power(10, 9) + 1
n, k = map(int, input().split())
a = [-inf] + list(map(int, input().split())) + [-inf]
p = [0] * (n + 2)
for i in range(1, n + 1):
    p[i] = p[i - 1] + a[i]
p[-1] = p[-2]
stack = []
push(stack, 0)
ans = [0] * (n + 2)
for i in range(n + 2):
    while a[top(stack)] > a[i]:
        ans[pop(stack)] = i
    push(stack, i)
imin = 1
res = [0] * (n - k + 2)
for i in range(1, n - k + 2):
    if imin < i:
        imin = i
    while ans[imin] < i + k:
        imin = ans[imin]
    res[i] = a[imin] * (p[i + k - 1] - p[i - 1])
 
#https://informatics.mccme.ru/moodle/mod/statements/view.php?chapterid=3583#1

from collections import deque
 
n, k = map(int, input().split())
a, d, c = list(map(int, input().split())), deque(), 0
bl = [(0, [])] * (n + k)
for i in range(n):
    c += a[i]
    if i > k - 1:
        c -= a[i - k]
    if i >= k and d[0] == i - k:
        d.popleft()
    while len(d) and a[d[-1]] >= a[i]:
        d.pop()
    d.append(i)
    if i >= k - 1:
        s = a[d[0]] * c
        bl[i] = max(bl[i - 1], (bl[i - k][0] + s, bl[i - k][1] + [i - k + 2]), key=lambda x: x[0])
        if i == n - 1:
            print(len(bl[i][1]))
            print(*bl[i][1])

tmp += x[i]
if i >= k - 1:
    if i > k - 1:
        tmp -= x[i - k]
    res[i] = max(res[i - 1], [res[i - k][0] + tmp * x[d[0]], res[i - k][1] + [i - k + 2]], key=lambda x: x[0])

from collections import deque
 
n, k = map(int, input().split())
x, d, ssum = list(map(int, input().split())), deque(), 0
b = deque()
for i in range(k+2):
    b.append((0,[]))
for i in range(n):
    ssum += x[i]
    if i >= k :
        ssum -= x[i - k]
        if d[0] == i - k :
            d.popleft()
    while len(d) and x[d[-1]] >= x[i]:
        d.pop()
    d.append(i)
    if i >= k - 1:
        i1 = (i-1)%(k+1)
        ik = (i-k)%(k+1)
        ii = i%(k+1)
        nb = (b[ik][0] + x[d[0]] * ssum, b[ik][1] + [i - k + 2])
        b[ii] = max(b[i1], nb, key=lambda x: x[0])
print(len(max(b)[1]))
print(*max(b)[1])