Exams

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.

分析：二分答案，然后考试按从后往前模拟check即可；

代码：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <climits>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#include <list>
#define rep(i,m,n) for(i=m;i<=n;i++)
#define rsp(it,s) for(set<int>::iterator it=s.begin();it!=s.end();it++)
#define mod 1000000007
#define inf 0x3f3f3f3f
#define llinf 0x3f3f3f3f3f3f3f3fLL
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ll long long
#define pi acos(-1.0)
#define pii pair<ll,int>
#define Lson L, mid, ls[rt]
#define Rson mid+1, R, rs[rt]
#define sys system("pause")
const int maxn=1e5+;
using namespace std;
ll gcd(ll p,ll q){return q==?p:gcd(q,p%q);}
ll qpow(ll p,ll q){ll f=;while(q){if(q&)f=f*p;p=p*p;q>>=;}return f;}
inline ll read()
{
    ll x=;int f=;char ch=getchar();
    while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}
    while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}
    return x*f;
}
int n,m,k,t,cnt[maxn],ok[maxn],op[maxn],now,ca,ans;
bool panduan(int p)
{
    queue<int>q;
    set<int>w;
    for(int i=p;i>=;i--)
    {
        if(ok[i])
        {
            if(w.find(ok[i])==w.end()&&!cnt[ok[i]])
            {
                q.push(ok[i]);
                w.insert(ok[i]);
            }
            else
            {
                if(!w.empty())
                {
                    if(++cnt[q.front()]==op[q.front()])
                    {
                        now++;
                        w.erase(q.front());
                        q.pop();
                    }
                }
            }
        }
        else
        {
            if(!w.empty())
                {
                    if(++cnt[q.front()]==op[q.front()])
                    {
                        now++;
                        w.erase(q.front());
                        q.pop();
                    }
                }
        }
    }
    return now==m;
}
int main()
{
    int i,j;
    ans=-;
    scanf("%d%d",&n,&m);
    rep(i,,n)scanf("%d",&ok[i]);
    rep(i,,m)scanf("%d",&op[i]);
    int l=,r=n;
    while(l<=r)
    {
        int mid=(l+r)>>;
        now=;
        memset(cnt,,sizeof(cnt));
        if(panduan(mid))
        {
            ans=mid,r=mid-;
        }
        else l=mid+;
    }
    printf("%d\n",ans);
    //system("Pause");
    return ;
}