codeforces 732D 模拟暴力

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

Note

In the first example Vasiliy can behave as follows. On the first and the second day he can prepare for the exam number 1 and pass it on the fifth day, prepare for the exam number 2 on the third day and pass it on the fourth day.

In the second example Vasiliy should prepare for the exam number 3 during the first four days and pass it on the fifth day. Then on the sixth day he should prepare for the exam number 2 and then pass it on the seventh day. After that he needs to prepare for the exam number 1 on the eighth day and pass it on the ninth day.

In the third example Vasiliy can't pass the only exam because he hasn't anough time to prepare for it.

题意：有n天m门课，给定每天的考试门数ai ，告诉你每门课的复习天数，并且规定一天最多考一门试，求最小在第几天可以结束所有的课程

分析：其实这里ai的大小是没有用的，只是起到了标记当天能不能考试得作用，所以我们按照天数用队列进行模拟，这一天如果不考试，那么对应的复习的那门课天数-1，当这门课的复习天数为0时，加入队列，当这天可以考试是，从队列里弹出一门考试；

代码：

/*
   Author:fanmeng
   Lang:C++
   PROB:ohha
*/
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <vector>
#include <set>

using namespace std;

int n,m;
int a[100005];
int b[100005];

int main() {
    cin >> n >> m;
    int sum = 0;
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    for(int j = 0; j < m; j++) {
        cin >> b[j];
        sum += b[j];
    }
    if(sum+m > n) {
        cout << "-1" << endl;
        return 0;
    }
    int k = 0;
    queue<int>q;
    for(int i = 1; i <= n; i++) {
        if(a[i]) {
            int tag = 0;
            if(!q.empty()) {
                q.pop();
                tag = 1;
            }
            if(k == m && q.empty()) {
                cout << i << endl;
                return 0;
            }
            if(!tag) {
                b[k]--;
            }
        } else {
            b[k]--;
        }
        if(b[k] == 0 && k != m) {
            q.push(k);
            k++;
        }
    }
    cout << "-1" << endl;
    return 0;
}