def search(n, m, k, a):
    for p in range(n-1):
        for i in range(n-k+1-p):
            m_new = 1
            mas = []
            for q in range(k-1):
                m_new *= a[p+q]
                mas.append(p+q)
            m_new *= a[i+k-1+p]
            mas.append(i+k-1+p)
            if m_new == m:
                return mas

line = input().split()
n = int(line[0])
m = int(line[1])
k = int(line[2])
a = []
for i in range(n):
    a.append(int(input()))

for i in search(n, m, k, a):
    print(i, end=' ')