CF374D.Inna and Sequence

Dima's spent much time thinking what present to give to Inna and gave her an empty sequence w. Now they want to fill sequence w with numbers zero and one. For that, they decided to play an amusing game.

Before the game begins, Dima chooses m integers _a_1, _a_2, ..., a__m (1 ≤ _a_1 < _a_2 < ... < a__m). Then Inna and Dima start playing, that is, adding numbers to sequence w. Each new number they choose is added to the end of the sequence. At some moments of time Dima feels that the game is going to end too soon (and he wants to play with Inna as long as possible), so he hits a table hard with his fist. At that the _a_1-th, _a_2-th, _a_3-th, ..., a__k-th numbers from the beginning simultaneously fall out of the sequence (the sequence gets k numbers less). Here k is such maximum number that value a__k doesn't exceed the current length of the sequence. If number _a_1 is larger than the current length of w, then nothing falls out of the sequence.

You are given the chronological sequence of events in the game. Each event is either adding a number to the end of sequence w or Dima's hit on the table. Calculate the sequence w after all these events happen.

季马花了很长时间思考该送什么礼物给因娜，最后送给了她一个空序列 $w$。现在他们想用数字 0 和 1 来填充序列 $w$。为此，他们决定玩一个有趣的游戏。

游戏开始前，季马选定 $m$ 个整数 $a_1,\,a_2,\,\dots,\,a_m$（满足 $1\le a_1<a_2<\dots<a_m$）。接着，因娜和季马开始游戏，即向序列 $w$ 中添加数字。每次新添加的数字均置于序列末尾。在某些时刻，季马觉得游戏即将过早结束（而他希望尽可能长时间地与因娜一起玩耍），于是便用力一拳砸向桌子。此时，序列开头起第 $a_1$ 个、第 $a_2$ 个、第 $a_3$ 个、……、第 $a_k$ 个数字会同时从序列中脱落（序列长度减少 $k$）。其中 $k$ 是满足 $a_k$ 不超过当前序列长度的最大整数。若 $a_1$ 大于当前序列 $w$ 的长度，则序列中没有任何数字脱落。

现给出游戏中事件发生的时序序列。每个事件要么是在序列 $w$ 末尾添加一个数字，要么是季马砸桌子。请计算在所有这些事件发生后序列 $w$ 的最终状态。

The first line of the input contains two integers n and m (1 ≤ n, m ≤ 106) showing how many events took place and how many numbers Dima chose.

The next line contains m distinct integers a__i (1 ≤ a__i ≤ 106) sorted in the increasing order.

Next n lines describe the events in the chronological order. Each line contains a single integer: -1, 0 or 1. Number -1 means that Dima hits the table. Number 0 means that Inna and Dima add number 0 to the end of the sequence. Number 1 means that Inna and Dima add number 1 to the end of the sequence.

输入的第一行包含两个整数 $n$ 和 $m$（$1 \leq n, m \leq 10^6$），分别表示发生的事件总数以及 Dima 所选择的数字个数。

第二行包含 $m$ 个互不相同的整数 $a_i$（$1 \leq a_i \leq 10^6$），按升序排列。

接下来的 $n$ 行按时间顺序描述各个事件。每行包含一个整数：$-1$、$0$ 或 $1$。其中，$-1$ 表示 Dima 敲击桌面；$0$ 表示 Inna 和 Dima 将数字 $0$ 添加到序列末尾；$1$ 表示 Inna 和 Dima 将数字 $1$ 添加到序列末尾。

In a single line print a sequence of numbers 0 and 1 — the elements of the sequence after all events happen. Print the elements of the sequence in the order from the beginning to the end of the sequence.

If after all events the sequence ends up empty, print "Poor stack!".

在一行中输出一串由数字 0 和 1 组成的序列——即所有事件发生后的序列元素。按序列从开头到结尾的顺序输出各元素。

如果所有事件结束后序列变为空，则输出 "Poor stack!"。