Codeforce-958F1

There is unrest in the Galactic Senate. Several thousand solar systems have declared their intentions to leave the Republic. Master Heidi needs to select the Jedi Knights who will go on peacekeeping missions throughout the galaxy. It is well-known that the success of any peacekeeping mission depends on the colors of the lightsabers of the Jedi who will go on that mission.

Heidi has n Jedi Knights standing in front of her, each one with a lightsaber of one of m possible colors. She knows that for the mission to be the most effective, she needs to select some contiguous interval of knights such that there are exactly k₁ knights with lightsabers of the first color, k₂ knights with lightsabers of the second color, ..., k_m knights with lightsabers of the m-th color. Help her find out if this is possible.

Input

The first line of the input contains n (1 ≤ n ≤ 100) and m (1 ≤ m ≤ n). The second line contains n integers in the range {1, 2, ..., m} representing colors of the lightsabers of the subsequent Jedi Knights. The third line contains m integers k₁, k₂, ..., k_m (with $\text{[math]}$ ) – the desired counts of lightsabers of each color from 1 to m.

Output

Output YES if an interval with prescribed color counts exists, or output NO if there is none.

Example

Input

5 2
1 1 2 2 1
1 2

Output

YES

我对题目最初的理解是输入两个数n,m；

再分别输入n，m个数，如果m中的数在n中都有则输出yes 否则no；因为样例只有一个，写出代码跑完样例提交后wa，我第一反应是我对题目的理解出错

附上问题代码：

#include <iostream>
#include <cstring>
using namespace std;
int main()
{
    int n,m;
    int a[101],b[101];
    bool vis[101];
    bool wyh=1;
    memset(vis,0,sizeof(vis));
    cin>>n>>m;
    for(int i=0;i<n;i++)
        cin>>a[i];
    for(int i=0;i<m;i++)
        cin>>b[i];
    for(int i=0;i<m;i++)
    {
        for(int j=0;j<n;j++)
        {
            if(b[i]==a[j])vis[i]=1;
        }
    }
    for(int i=0;i<m;i++)
    {
        if(vis[i]==0){cout<<"NO"<<endl;
        wyh=0;}
    }
    if(wyh)cout<<"YES"<<endl;

return 0;
}

猜你喜欢