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 a1, a2, ..., am (1 ≤ a1 < a2 < ... < am). 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 a1-th, a2-th, a3-th, ..., ak-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 ak doesn't exceed the current length of the sequence. If number a1 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.

Input

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 ai (1 ≤ ai ≤ 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.

Output

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!".

Examples

Input

10 3
1 3 6
-1
1
1
0
0
-1
0
1
-1
1


Output

011


Input

2 1
1
1
-1


Output

Poor stack!
import java.util.*;
import java.io.*;

/*

10 3
1 3 4
-1
1
1
0
0
-1
0
1
-1
1



 */

public class dd {
	
	public static void main(String[] args) throws IOException {
		
		FastScanner qwe = new FastScanner(System.in);
		
		int n = qwe.nextInt();
		int m = qwe.nextInt();
		
		int[] a = new int[m];
		for (int i = 0; i < a.length; i++) {
			a[i] = qwe.nextInt();
		}
		
		int time = 0;
		
		Treap root = new Treap(time,2);
		
		while(n-->0){
			int op  = qwe.nextInt();
			time++;
			if(op == -1){
				
				ArrayList<Integer> torem = new ArrayList<Integer>();
				
				for (int i = 0; i < a.length; i++) {
					if(root.count-1 < a[i]) break;
					//System.out.println("looking for " + a[i]);
					torem.add(kth(root,a[i]));
				}
				
				for(int rem : torem){
					root = remove(root,rem);
				}
				
			}
			else if (op == 1){
				root = insert(root, time, 1);
			}
			else{
				root = insert(root, time, 0);
			}
			
			
			//System.out.println("printing: " + print(root));
			
		}
		
		if(root.count == 1) System.out.println("Poor stack!");
		else{
			System.out.println(print(root).substring(1));
		}
		
		
		qwe.close();
		
	}
	
	  static int getCount(Treap root) {
		    return root == null ? 0 : root.count;
		  }

		  static class TreapPair {
		    Treap left;
		    Treap right;

		    TreapPair(Treap left, Treap right) {
		      this.left = left;
		      this.right = right;
		    }
		  }

		  static TreapPair split(Treap root, int minRight) {
		    if (root == null)
		      return new TreapPair(null, null);
		    if (root.key >= minRight) {
		      TreapPair leftSplit = split(root.left, minRight);
		      root.left = leftSplit.right;
		      root.update();
		      leftSplit.right = root;
		      return leftSplit;
		    } else {
		      TreapPair rightSplit = split(root.right, minRight);
		      root.right = rightSplit.left;
		      root.update();
		      rightSplit.left = root;
		      return rightSplit;
		    }
		  }

		  static Treap merge(Treap left, Treap right) {
		    if (left == null)
		      return right;
		    if (right == null)
		      return left;
		    if (left.prio > right.prio) {
		      left.right = merge(left.right, right);
		      left.update();
		      return left;
		    } else {
		      right.left = merge(left, right.left);
		      right.update();
		      return right;
		    }
		  }

		  static Treap insert(Treap root, int x, int num) {
		    TreapPair t = split(root, x);
		    return merge(merge(t.left, new Treap(x,num)), t.right);
		  }

		  static Treap remove(Treap root, int x) {
		    if (root == null) {
		      return null;
		    }
		    if (x < root.key) {
		      root.left = remove(root.left, x);
		      root.update();
		      return root;
		    } else if (x > root.key) {
		      root.right = remove(root.right, x);
		      root.update();
		      return root;
		    } else {
		      return merge(root.left, root.right);
		    }
		  }

		  static int kth(Treap root, int k) {
			  
			  //System.out.println("my count is "  +root.count  + " left count is "+getCount(root.left)+ " k left " + k);
			  
		    if (k < getCount(root.left))
		      return kth(root.left, k);
		    else if (k > getCount(root.left))
		      return kth(root.right, k - getCount(root.left) - 1);
		    return root.key;
		  }

		  static StringBuilder print(Treap root) {
		    if (root == null) 
		      return new StringBuilder("");
		    
		    StringBuilder ret = print(root.left);
		    ret.append(root.num);
		    ret.append(print(root.right));
		    return ret;
		  }
	
	static class Treap {
		  static Random random = new Random();

		    int key,num;
		    long prio;
		    Treap left;
		    Treap right;
		    int count;

		    Treap(int key, int num) {
		      this.key = key;
		      this.num = num;
		      prio = random.nextLong();
		      count = 1;
		    }

		    void update() {
		      count = 1 + getCount(left) + getCount(right);
		    }
		  
		    
		    //these functions should go outside the Treap class

		}
	
	static class FastScanner
	{
		BufferedReader br;
		StringTokenizer st;
		public FastScanner(InputStream in)
		{
			br = new BufferedReader(new InputStreamReader(in));
			st = new StringTokenizer("");
		}
		public String next() throws IOException
		{
			while(!st.hasMoreTokens()) st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}
		public int nextInt() throws IOException
		{
			return Integer.parseInt(next());
		}
		public void close() throws IOException
		{
			br.close();
		}
	}

}
