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*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*m*</sub> (1 ≤ *a*<sub class="lower-index">1</sub> &lt; *a*<sub class="lower-index">2</sub> &lt; ... &lt; *a*<sub class="lower-index">*m*</sub>). 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*<sub class="lower-index">1</sub>-th, *a*<sub class="lower-index">2</sub>-th, *a*<sub class="lower-index">3</sub>-th, ..., *a*<sub class="lower-index">*k*</sub>-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*<sub class="lower-index">*k*</sub> doesn't exceed the current length of the sequence. If number *a*<sub class="lower-index">1</sub> 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.
The first line of the input contains two integers *n* and *m* (1 ≤ *n*, *m* ≤ 10<sup class="upper-index">6</sup>) showing how many events took place and how many numbers Dima chose.

The next line contains *m* distinct integers *a*<sub class="lower-index">*i*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">6</sup>) 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.
from collections import deque
n,m=map(int,input().split())
s=[0]+list(map(int,input().split()))
dp=[deque() for i in range(m+1)]
ind=0
for i in range(n):
    x=input()
    if x!="-1":
        if ind!=m and ((ind==0 and len(dp[ind])+1==s[ind+1]) or(len(dp[ind])+s[ind]==s[ind+1])):
            ind+=1
        dp[ind].append(x)
        continue
    if ind==0:
        continue
    for j in range(1,ind+1):
        dp[j].popleft()
    a=1
    b=2
    while a<ind and b<=ind:
        if len(dp[b])==0:
            b+=1
            continue
        dp[a].append(dp[b][0])
        dp[b].popleft()
        if len(dp[a])+s[a]==s[a+1]:
            a+=1
    if len(dp[1])==0:
        ind=1
        continue
    if len(dp[ind])!=0:
        continue
    y=-1
    for j in range(ind,0,-1):
        if len(dp[j])==0 and len(dp[j-1])!=0:
            y=j-1
            break
    if len(dp[y])+s[y]==s[y+1]:
        ind=y+1
    else:
        ind=y
ans=""
for i in dp:
    for j in i:
        ans+=j
if len(ans)==0:
    print("Poor stack!")
else:
    print(ans)
        
    
            
    
            
        
