Codeforces-1354D-Multiset（权值线段树+二分+内存优化）

D. Multiset

Note that the memory limit is unusual.

You are given a multiset consisting of n integers. You have to process queries of two types:

add integer k into the multiset;
find the k-th order statistics in the multiset and remove it.
k-th order statistics in the multiset is the k-th element in the sorted list of all elements of the multiset. For example, if the multiset contains elements 1, 4, 2, 1, 4, 5, 7, and k=3, then you have to find the 3-rd element in [1,1,2,4,4,5,7], which is 2. If you try to delete an element which occurs multiple times in the multiset, only one occurence is removed.

After processing all queries, print any number belonging to the multiset, or say that it is empty.

Input

The first line contains two integers n and q (1≤n,q≤10⁶) — the number of elements in the initial multiset and the number of queries, respectively.

The second line contains n integers a1, a2, …, an (1≤a1≤a2≤⋯≤an≤n) — the elements of the multiset.

The third line contains q integers k1, k2, …, kq, each representing a query:

if 1≤ki≤n, then the i-th query is “insert ki into the multiset”;
if ki<0, then the i-th query is “remove the |ki|-th order statistics from the multiset”. For this query, it is guaranteed that |ki| is not greater than the size of the multiset.

Output

If the multiset is empty after all queries, print 0.

Otherwise, print any integer that belongs to the resulting multiset.

Examples

input

5 5
1 2 3 4 5
-1 -1 -1 -1 -1

output

0

input

5 4
1 2 3 4 5
-5 -1 -3 -1

output

3

input

6 2
1 1 1 2 3 4
5 6

output

6

Note

In the first example, all elements of the multiset are deleted.

In the second example, the elements 5, 1, 4, 2 are deleted (they are listed in chronological order of their removal).

In the third example, 6 is not the only answer.

解题思路：

权值线段树。
查找的时候二分，不是二分区间端点了，而是二分区间和。

内存只有28MB。开结构体就会超内存。所以只能开一个数组存线段树。区间端点体现在函数参数里。

AC代码：

#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <iostream>
#include <algorithm>
#include <iomanip>
using namespace std;
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#