Problem: 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!

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long int INF = (long long int)1e9 + 10;
const long long int INFLL = (long long int)1e18 + 10;
const long double EPS = 1e-8;
const long double EPSLD = 1e-18;
const long long int MOD = 1e9 + 7;
template <class T>
T &chmin(T &a, const T &b) {
  return a = min(a, b);
}
template <class T>
T &chmax(T &a, const T &b) {
  return a = max(a, b);
}
struct RBST {
  struct node {
    int val;
    int size;
    node *chl, *chr;
    node() {
      size = 1;
      chl = chr = NULL;
    }
    node(int val) : val(val) {
      size = 1;
      chl = chr = NULL;
    }
  };
  typedef pair<node *, node *> pn;
  node nodes[10000000];
  int p;
  node *root;
  mt19937 mt;
  RBST() {
    root = NULL;
    mt.seed(time(NULL));
  };
  int size(node *t) { return !t ? 0 : t->size; }
  int val(node *t) { return !t ? 0 : t->val; }
  node *newnode(int val) {
    nodes[p] = node(val);
    return &nodes[p++];
  }
  node *update(node *t) {
    t->size = size(t->chl) + size(t->chr) + 1;
    return t;
  }
  node *merge(node *l, node *r) {
    if (!l) return r;
    if (!r) return l;
    if ((int)mt() % (size(l) + size(r)) < size(l)) {
      l->chr = merge(l->chr, r);
      return update(l);
    } else {
      r->chl = merge(l, r->chl);
      return update(r);
    }
  }
  pn split(node *t, int k) {
    if (!t) return pn(NULL, NULL);
    if (k <= size(t->chl)) {
      pn s = split(t->chl, k);
      t->chl = s.second;
      return pn(s.first, update(t));
    } else {
      pn s = split(t->chr, k - size(t->chl) - 1);
      t->chr = s.first;
      return pn(update(t), s.second);
    }
  }
  node *insert(node *t, int k, int val) {
    pn s = split(t, k);
    node *u = newnode(val);
    return merge(merge(s.first, u), s.second);
  }
  void insert(int k, int val) { root = insert(root, k, val); }
  node *erase(node *t, int k) {
    pn sa = split(t, k);
    pn sb = split(sa.second, 1);
    return merge(sa.first, sb.second);
  }
  void erase(int k) { root = erase(root, k); }
  node *find(node *t, int k) {
    if (!t) return NULL;
    if (k < size(t->chl))
      return find(t->chl, k);
    else if (k == size(t->chl))
      return t;
    else
      return find(t->chr, k - size(t->chl) - 1);
  }
  node *find(int k) { return find(root, k); }
  int size() { return size(root); }
};
RBST rbst;
const long long int MAX_N = 1000010;
long long int n, m;
long long int a[MAX_N];
int main() {
  scanf("%lld %lld", &n, &m);
  for (long long int i = (0); i < (long long int)(m); i++)
    scanf("%lld", &a[i]), a[i]--;
  for (long long int i = (0); i < (long long int)(n); i++) {
    long long int x;
    scanf("%lld", &x);
    if (x == -1) {
      for (long long int i = (0); i < (long long int)(m); i++) {
        if (((long long int)(rbst).size()) > a[i] - i)
          rbst.erase(a[i] - i);
        else
          break;
      }
    } else {
      rbst.insert(((long long int)(rbst).size()), x);
    }
  }
  if (((long long int)(rbst).size()) == 0)
    printf("Poor stack!");
  else
    for (long long int i = (0);
         i < (long long int)(((long long int)(rbst).size())); i++)
      printf("%d", rbst.val(rbst.find(i)));
  printf("\n");
  return 0;
}