{"raw_statement":[{"iden":"statement","content":"A few years ago, Hitagi encountered a giant crab, who stole the whole of her body weight. Ever since, she tried to avoid contact with others, for fear that this secret might be noticed.\n\nTo get rid of the oddity and recover her weight, a special integer sequence is needed. Hitagi's sequence has been broken for a long time, but now Kaiki provides an opportunity.\n\nHitagi's sequence _a_ has a length of _n_. Lost elements in it are denoted by zeros. Kaiki provides another sequence _b_, whose length _k_ equals the number of lost elements in _a_ (i.e. the number of zeros). Hitagi is to replace each zero in _a_ with an element from _b_ so that **each element in _b_ should be used exactly once**. Hitagi knows, however, that, **apart from 0, no integer occurs in _a_ and _b_ more than once in total.**\n\nIf the resulting sequence is **not** an increasing sequence, then it has the power to recover Hitagi from the oddity. You are to determine whether this is possible, or Kaiki's sequence is just another fake. In other words, you should detect whether it is possible to replace each zero in _a_ with an integer from _b_ so that each integer from _b_ is used exactly once, and the resulting sequence is **not** increasing."},{"iden":"input","content":"The first line of input contains two space-separated positive integers _n_ (2 ≤ _n_ ≤ 100) and _k_ (1 ≤ _k_ ≤ _n_) — the lengths of sequence _a_ and _b_ respectively.\n\nThe second line contains _n_ space-separated integers _a_1, _a_2, ..., _a__n_ (0 ≤ _a__i_ ≤ 200) — Hitagi's broken sequence with exactly _k_ zero elements.\n\nThe third line contains _k_ space-separated integers _b_1, _b_2, ..., _b__k_ (1 ≤ _b__i_ ≤ 200) — the elements to fill into Hitagi's sequence.\n\nInput guarantees that apart from 0, no integer occurs in _a_ and _b_ more than once in total."},{"iden":"output","content":"Output \"_Yes_\" if it's possible to replace zeros in _a_ with elements in _b_ and make the resulting sequence not increasing, and \"_No_\" otherwise."},{"iden":"examples","content":"Input\n\n4 2\n11 0 0 14\n5 4\n\nOutput\n\nYes\n\nInput\n\n6 1\n2 3 0 8 9 10\n5\n\nOutput\n\nNo\n\nInput\n\n4 1\n8 94 0 4\n89\n\nOutput\n\nYes\n\nInput\n\n7 7\n0 0 0 0 0 0 0\n1 2 3 4 5 6 7\n\nOutput\n\nYes"},{"iden":"note","content":"In the first sample:\n\n*   Sequence _a_ is 11, 0, 0, 14.\n*   Two of the elements are lost, and the candidates in _b_ are 5 and 4.\n*   There are two possible resulting sequences: 11, 5, 4, 14 and 11, 4, 5, 14, both of which fulfill the requirements. Thus the answer is \"_Yes_\".\n\nIn the second sample, the only possible resulting sequence is 2, 3, 5, 8, 9, 10, which is an increasing sequence and therefore invalid."}],"translated_statement":[{"iden":"statement","content":"几年前，Hitagi 遇到了一只巨大的螃蟹，它偷走了她全身的体重。从此以后，她试图避免与他人接触，担心这个秘密会被发现。\n\n为了摆脱这种怪异现象并恢复体重，她需要一个特殊的整数序列。Hitagi 的序列已经破损很长时间了，但现在 Kaiki 提供了一个机会。\n\nHitagi 的序列 #cf_span[a] 长度为 #cf_span[n]。其中丢失的元素用零表示。Kaiki 提供了另一个序列 #cf_span[b]，其长度 #cf_span[k] 等于 #cf_span[a] 中丢失元素的个数（即零的个数）。Hitagi 需要将 #cf_span[a] 中的每个零替换为 #cf_span[b] 中的一个元素，使得 #cf_span[b] 中的每个元素恰好使用一次。然而，Hitagi 知道，*除了 #cf_span[0] 之外，#cf_span[a] 和 #cf_span[b] 中的任何整数在整体上至多出现一次*。\n\n如果最终得到的序列 *不是* 递增序列，那么它就具有帮助 Hitagi 摆脱怪异现象的力量。你需要判断这是否可能，或者 Kaiki 的序列只是另一个骗局。换句话说，你需要判断是否可能将 #cf_span[a] 中的每个零替换为 #cf_span[b] 中的整数，使得 #cf_span[b] 中的每个整数恰好使用一次，且最终序列 *不是* 递增的。\n\n输入的第一行包含两个用空格分隔的正整数 #cf_span[n] (#cf_span[2 ≤ n ≤ 100]) 和 #cf_span[k] (#cf_span[1 ≤ k ≤ n]) —— 分别表示序列 #cf_span[a] 和 #cf_span[b] 的长度。\n\n第二行包含 #cf_span[n] 个用空格分隔的整数 #cf_span[a1, a2, ..., an] (#cf_span[0 ≤ ai ≤ 200]) —— Hitagi 的破损序列，其中恰好有 #cf_span[k] 个零元素。\n\n第三行包含 #cf_span[k] 个用空格分隔的整数 #cf_span[b1, b2, ..., bk] (#cf_span[1 ≤ bi ≤ 200]) —— 用于填入 Hitagi 序列的元素。\n\n输入保证，除了 #cf_span[0] 之外，#cf_span[a] 和 #cf_span[b] 中的任何整数在整体上至多出现一次。\n\n如果可以将 #cf_span[a] 中的零替换为 #cf_span[b] 中的元素，使得结果序列不是递增的，则输出 \"_Yes_\"；否则输出 \"_No_\"。\n\n在第一个样例中：\n\n在第二个样例中，唯一可能得到的序列是 #cf_span[2, 3, 5, 8, 9, 10]，这是一个递增序列，因此无效。"},{"iden":"input","content":"输入的第一行包含两个用空格分隔的正整数 #cf_span[n] (#cf_span[2 ≤ n ≤ 100]) 和 #cf_span[k] (#cf_span[1 ≤ k ≤ n]) —— 分别表示序列 #cf_span[a] 和 #cf_span[b] 的长度。第二行包含 #cf_span[n] 个用空格分隔的整数 #cf_span[a1, a2, ..., an] (#cf_span[0 ≤ ai ≤ 200]) —— Hitagi 的破损序列，其中恰好有 #cf_span[k] 个零元素。第三行包含 #cf_span[k] 个用空格分隔的整数 #cf_span[b1, b2, ..., bk] (#cf_span[1 ≤ bi ≤ 200]) —— 用于填入 Hitagi 序列的元素。输入保证，除了 #cf_span[0] 之外，#cf_span[a] 和 #cf_span[b] 中的任何整数在整体上至多出现一次。"},{"iden":"output","content":"如果可以将 #cf_span[a] 中的零替换为 #cf_span[b] 中的元素，使得结果序列不是递增的，则输出 \"_Yes_\"；否则输出 \"_No_\"。"},{"iden":"examples","content":"输入\n4 2\n11 0 0 14\n5 4\n输出\nYes\n\n输入\n6 1\n2 3 0 8 9 10\n5\n输出\nNo\n\n输入\n4 1\n8 9\n4 0 489\n输出\nYes\n\n输入\n7 7\n0 0 0 0 0 0 0\n1 2 3 4 5 6 7\n输出\nYes"},{"iden":"note","content":"在第一个样例中：\n序列 #cf_span[a] 是 #cf_span[11, 0, 0, 14]。\n有两个元素丢失，#cf_span[b] 中的候选元素是 #cf_span[5] 和 #cf_span[4]。\n有两种可能的最终序列：#cf_span[11, 5, 4, 14] 和 #cf_span[11, 4, 5, 14]，两者都满足要求。因此答案是 \"_Yes_\"。\n在第二个样例中，唯一可能得到的序列是 #cf_span[2, 3, 5, 8, 9, 10]，这是一个递增序列，因此无效。"}],"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ n, k \\in \\mathbb{Z}^+ $ with $ 2 \\leq n \\leq 100 $, $ 1 \\leq k \\leq n $.  \nLet $ A = (a_1, a_2, \\dots, a_n) $ be a sequence of integers where exactly $ k $ elements are $ 0 $, and all non-zero elements are distinct and lie in $ [1, 200] $.  \nLet $ B = (b_1, b_2, \\dots, b_k) $ be a sequence of $ k $ distinct integers in $ [1, 200] $, such that $ A \\setminus \\{0\\} $ and $ B $ are disjoint sets.\n\nLet $ \\mathcal{R} $ be the set of all sequences $ R = (r_1, \\dots, r_n) $ obtained by replacing each $ 0 $ in $ A $ with a distinct element from $ B $ (i.e., bijection from zero positions to $ B $).\n\n**Constraints**  \n1. $ |\\{ i \\mid a_i = 0 \\}| = k $  \n2. All non-zero $ a_i $ are distinct.  \n3. All $ b_j $ are distinct.  \n4. $ \\{ a_i \\mid a_i \\neq 0 \\} \\cap B = \\emptyset $\n\n**Objective**  \nDetermine whether there exists $ R \\in \\mathcal{R} $ such that $ R $ is **not** strictly increasing, i.e.,  \n$$\n\\exists i \\in \\{1, \\dots, n-1\\} \\text{ such that } r_i \\geq r_{i+1}\n$$  \nOutput \"Yes\" if such an $ R $ exists; otherwise, output \"No\".","simple_statement":null,"has_page_source":false}