Alice and Bob love playing one-dimensional battle ships. They play on the field in the form of a line consisting of n square cells (that is, on a 1 × n table).

At the beginning of the game Alice puts k ships on the field without telling their positions to Bob. Each ship looks as a 1 × a rectangle (that is, it occupies a sequence of a consecutive squares of the field). The ships cannot intersect and even touch each other.

After that Bob makes a sequence of "shots". He names cells of the field and Alice either says that the cell is empty ("miss"), or that the cell belongs to some ship ("hit").

But here's the problem! Alice like to cheat. May be that is why she responds to each Bob's move with a "miss". 

Help Bob catch Alice cheating — find Bob's first move, such that after it you can be sure that Alice cheated.


-----Input-----

The first line of the input contains three integers: n, k and a (1 ≤ n, k, a ≤ 2·10^5) — the size of the field, the number of the ships and the size of each ship. It is guaranteed that the n, k and a are such that you can put k ships of size a on the field, so that no two ships intersect or touch each other.

The second line contains integer m (1 ≤ m ≤ n) — the number of Bob's moves.

The third line contains m distinct integers x_1, x_2, ..., x_{m}, where x_{i} is the number of the cell where Bob made the i-th shot. The cells are numbered from left to right from 1 to n.


-----Output-----

Print a single integer — the number of such Bob's first move, after which you can be sure that Alice lied. Bob's moves are numbered from 1 to m in the order the were made. If the sought move doesn't exist, then print "-1".


-----Examples-----
Input
11 3 3
5
4 8 6 1 11

Output
3

Input
5 1 3
2
1 5

Output
-1

Input
5 1 3
1
3

Output
1

Difficulty: interview

Starter code:

Solutions:
n,k,a = map(int,input().split())
m = int(input())
x = [int(y) for y in input().split()]

def check(K):
    used = [0]*(n+1)
    for i in range(K):
        used[x[i]] = 1
    for i in range(1,n+1):
        used[i]+=used[i-1]
    have = 0
    i = a
    while i<n+1:
        if used[i]-used[i-a]==0:
            have+=1
            i+=a
        i+=1
    return have>=k

if check(m):
    print(-1)
else:
    low = -1
    high = m
    while high-low>1:
        if check((low+high+1)//2):
            low = (low+high+1)//2
        else:
            high = (low+high+1)//2
    print(high)

n,k,a=list(map(int,input().split()))
m=int(input())+1
x=list(map(int,input().split()))+[0]
l,r=0,m
while r-l>1:
	d=(l+r)//2
	y=sorted(x[:d])
	if sum((q-p)//(a+1) for p,q in zip([0]+y,y+[n+1]))>=k:l=d
	else:r=d
print(r%m-(r==m))


n,k,b = map(int,input().split())
m = int(input())+1
b += 1
a = list(map(int,input().split()))
l,r = 0,m
while r-l > 1:
    d = (l+r)//2
    c = sorted(a[:d])
    if sum([(p-q)//b for q,p in zip([0]+c,c+[n+1])]) >= k:
        l = d
    else:
        r = d
print(r%m-(r==m))

n,k,a=list(map(int,input().split()))
m=int(input())+1
x=list(map(int,input().split()))+[0]
l,r=0,m
while r-l>1:
	d=(l+r)//2
	y=sorted(x[:d])
	if sum((q-p)//(a+1) for p,q in zip([0]+y,y+[n+1]))>=k:l=d
	else:r=d
print(r%m-(r==m))



n,k,a=list(map(int,input().split()))
m=int(input())+1
x=list(map(int,input().split()))+[0]
l,r=0,m
while r-l>1:
	d=(l+r)//2
	y=sorted(x[:d])
	if sum((q-p)//(a+1) for p,q in zip([0]+y,y+[n+1]))>=k:l=d
	else:r=d
print(r%m-(r==m))



n,k,a=list(map(int,input().split()))
m=int(input())+1
x=list(map(int,input().split()))+[0]
l,r=0,m
while r-l>1:
	d=(l+r)//2
	y=sorted(x[:d])
	if sum((q-p)//(a+1) for p,q in zip([0]+y,y+[n+1]))>=k:l=d
	else:r=d
print(r%m-(r==m))



n,k,a=list(map(int,input().split()))
m=int(input())+1
x=list(map(int,input().split()))+[0]
l,r=0,m
while r-l>1:
	d=(l+r)//2
	y=sorted(x[:d])
	if sum((q-p)//(a+1) for p,q in zip([0]+y,y+[n+1]))>=k:l=d
	else:r=d
print(r%m-(r==m))



n,k,a=list(map(int,input().split()))
m=int(input())+1
x=list(map(int,input().split()))+[0]
l,r=0,m
while r-l>1:
	d=(l+r)//2
	y=sorted(x[:d])
	if sum((q-p)//(a+1) for p,q in zip([0]+y,y+[n+1]))>=k:l=d
	else:r=d
print(r%m-(r==m))



n,k,a=list(map(int,input().split()))
m=int(input())+1
x=list(map(int,input().split()))+[0]
l,r=0,m
while r-l>1:
	d=(l+r)//2
	y=sorted(x[:d])
	if sum((q-p)//(a+1) for p,q in zip([0]+y,y+[n+1]))>=k:l=d
	else:r=d
print(r%m-(r==m))



n,k,a=list(map(int,input().split()))
m=int(input())+1
x=list(map(int,input().split()))+[0]
l,r=0,m
while r-l>1:
	d=(l+r)//2
	y=sorted(x[:d])
	if sum((q-p)//(a+1) for p,q in zip([0]+y,y+[n+1]))>=k:l=d
	else:r=d
print(r%m-(r==m))



import math
from bisect import bisect_right, bisect_left
from collections import Counter, defaultdict
from heapq import heappop, heappush
from itertools import accumulate

R = lambda: map(int, input().split())
mm, k, a = R()
junk = int(input())
arr = list(R())

l, r = 0, len(arr)
while l < r:
    m = (l + r) // 2
    tarr = [0] + sorted(arr[:m + 1]) + [mm + 1]
    cnt = 0
    for i in range(1, len(tarr)):
        cnt += (tarr[i] - tarr[i - 1]) // (a + 1)
    if cnt < k:
        r = m
    else:
        l = m + 1
print(l + 1 if l < len(arr) else -1)

import sys

def minp():
	return sys.stdin.readline().strip()

def mint():
	return int(minp())

def mints():
	return list(map(int, minp().split()))

def solve():
	n, k, a = mints()
	a += 1
	m = mint()
	x = list(mints())
	l = 0
	r = m + 1
	while r - l > 1:
		c = (l + r) // 2
		b = x[:c]
		b.sort()
		last = 0
		cnt = 0
		for i in b:
			if i != last:
				cnt += (i-last) // a
			last = i
		cnt += (n+1-last)//a
		if cnt < k:
			r = c
		else:
			l = c
	if r == m + 1:
		r = -1
	print(r)

solve()