CodeForces - 567D One-Dimensional Battle Ships ----set+二分

time limit per test：1 second

memory limit per test：256 megabytes

input：standard input

output：standard output

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·105) — 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 x1, x2, ..., xm, where xi 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

题意：在n*1的网格中的可以保证能够放置k个长度为a的船，Bob对船进行射击，则表示被射击的位置不可以放船，求Bob射击移动到第几个位置的时候n*1的网格放不下k个小船，注意：船与船之间不相邻，至少必须空一格。由这一条信息可以知道一艘船占地面积为a+1，最初始时n*1的网格中最后放置的一艘船占地面积为a，不算空格，所以我们需要模拟编号为n+1的网格用来存放空格，所以最初始时n*1的网格中最多可以放（n+1）/（a+1）艘船。然后每射击一次计算当前网格中最多可以按要求放置多少条船，用二分法计算，最后若放置的船小于题目要求的数量则输出射击的次数。

就例1来看：（随手画的有点小丑）

两个穿之间不相邻这点一定要注意，我用了各种奇奇怪怪的方法写写了我一两个小时最后还是因为这一点WA了，/(ㄒoㄒ)/~~

#include <iostream>
#include <set>
using namespace std;
int main()
{
    set<int>s;
    int n,k,a,m,d;
    cin>>n>>k>>a>>m;
    s.insert(0);
    s.insert(n+1);
    int ans=(n+1)/(a+1);
    int cont=-1,b=0;
    for(int i=1;i<=m;i++)
    {
        cin>>d;
        int e=*s.lower_bound(d);
        int f=*--s.lower_bound(d);
        s.insert(d)
        ans-=(e-f)/(a+1);
        ans+=(e-d)/(a+1)+(d-f)/(a+1);
        if(ans<k&&b==0){cont=i;b=1;}
    }
    cout<<cont<<endl;
}