CF958F1.Lightsabers (easy)

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_1 knights with lightsabers of the first color, _k_2 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.

银河议会局势动荡，数千个恒星系已宣布意图脱离共和国。海蒂大师需要挑选绝地武士，派遣他们前往银河系各处执行维和任务。众所周知，任何维和任务的成功与否，取决于参与该任务的绝地武士光剑的颜色组合。

海蒂面前站着 $n$ 名绝地武士，每人手持一把 $m$ 种可能颜色之一的光剑。她深知：为使任务效果达到最佳，必须选出一段连续区间的武士，使得其中恰好有 $k_1$ 名武士持有第一种颜色的光剑，$k_2$ 名武士持有第二种颜色的光剑，……，$k_m$ 名武士持有第 $m$ 种颜色的光剑。请帮她判断是否存在满足条件的区间。

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_1, _k_2, ..., k__m (with ) – the desired counts of lightsabers of each color from 1 to m.

输入的第一行包含两个整数 $n$（$1 \leq n \leq 100$）和 $m$（$1 \leq m \leq n$）。
第二行包含 $n$ 个整数，取值范围为 $\{1, 2, \dots, m\}$，表示后续绝地武士的光剑颜色。
第三行包含 $m$ 个整数 $k_1, k_2, \dots, k_m$（满足 ），即颜色 $1$ 至 $m$ 的光剑所需数量。

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

如果存在一个满足指定颜色计数的区间，则输出 YES；否则（即不存在这样的区间），输出 NO。