Codeforces Round #377 (Div. 2)-D. Exams

原题链接

D. Exams

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Vasiliy has an exam period which will continue for n days. He has to pass exams on m subjects. Subjects are numbered from 1 to m.

About every day we know exam for which one of m subjects can be passed on that day. Perhaps, some day you can't pass any exam. It is not allowed to pass more than one exam on any day.

On each day Vasiliy can either pass the exam of that day (it takes the whole day) or prepare all day for some exam or have a rest.

About each subject Vasiliy know a number ai — the number of days he should prepare to pass the exam number i. Vasiliy can switch subjects while preparing for exams, it is not necessary to prepare continuously during ai days for the exam number i. He can mix the order of preparation for exams in any way.

Your task is to determine the minimum number of days in which Vasiliy can pass all exams, or determine that it is impossible. Each exam should be passed exactly one time.

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 105) — the number of days in the exam period and the number of subjects.

The second line contains n integers d1, d2, ..., dn (0 ≤ di ≤ m), where di is the number of subject, the exam of which can be passed on the day number i. If di equals 0, it is not allowed to pass any exams on the day number i.

The third line contains m positive integers a1, a2, ..., am (1 ≤ ai ≤ 105), where ai is the number of days that are needed to prepare before passing the exam on the subject i.

Output

Print one integer — the minimum number of days in which Vasiliy can pass all exams. If it is impossible, print -1.

Examples

input

7 2
0 1 0 2 1 0 2
2 1

output

5

input

10 3
0 0 1 2 3 0 2 0 1 2
1 1 4

output

9

input

5 1
1 1 1 1 1
5

output

-1

找到所有考试的时间点i(在i,包括i,之前所有考试都已经出现过),记录在v[]中.二分v中数据找到最小的时间点，满足所有考试都通过.

#include <bits/stdc++.h>
#define maxn 100005
#define MOD 1000000007
using namespace std;
typedef long long ll;

int n, m;
int num[maxn], vis[maxn], a[maxn];
vector<int> v;
bool judge(int h){
	memset(vis, 0, sizeof(vis));
	int cnt = 0;
	for(int i = h; i >= 1; i--){
		if(num[i] && vis[num[i]] == 0){
			vis[num[i]] = 1;
			cnt += a[num[i]];
		} 
		else if(cnt)
		 cnt--;
	}
	if(cnt)
	 return false;
	return true;
}
int main(){
//	freopen("in.txt", "r", stdin);
	int n, m;
	int cnt = 0;
	scanf("%d%d", &n, &m);
	for(int i = 1; i <= n; i++){
		scanf("%d", num+i);
		if(num[i] == 0)
		 continue;
		if(vis[num[i]] == 0){
			vis[num[i]] = 1;
			cnt++;
		}
		if(cnt == m && vis[num[i]]){
			v.push_back(i);
		}
	}
	ll d = 0;
	for(int i = 1; i <= m; i++){
		scanf("%d", a+i);
		d += a[i];
	}
	if(cnt < m || d + m > n){
		puts("-1");
		return 0;
	}
	int l = 0, r = v.size();
	while(l < r){
		int mid = (l + r) >> 1;
		if(judge(v[mid]))
		 r = mid;
		else
		 l = mid + 1;
	}
	if(l == v.size())
	 puts("-1");
	else
	 printf("%d\n", v[l]);
	return 0;
}