CF374D.Inna and Sequence

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

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

Before the game begins, Dima chooses mm integers a1,a2,...,ama_{1},a_{2},...,a_{m} (1<=a1<a2<...<am)(1<=a_{1}<a_{2}<...<a_{m}) . Then Inna and Dima start playing, that is, adding numbers to sequence ww . 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 a1a_{1} -th, a2a_{2} -th, a3a_{3} -th, ...... , aka_{k} -th numbers from the beginning simultaneously fall out of the sequence (the sequence gets kk numbers less). Here kk is such maximum number that value aka_{k} doesn't exceed the current length of the sequence. If number a1a_{1} is larger than the current length of ww , 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 ww or Dima's hit on the table. Calculate the sequence ww after all these events happen.

输入格式

The first line of the input contains two integers nn and mm (1<=n,m<=106)(1<=n,m<=10^{6}) showing how many events took place and how many numbers Dima chose.

The next line contains mm distinct integers aia_{i} (1<=ai<=106)(1<=a_{i}<=10^{6}) sorted in the increasing order.

Next nn 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.

输出格式

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

输入输出样例

  • 输入#1

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

    输出#1

    011
    
  • 输入#2

    2 1
    1
    1
    -1
    

    输出#2

    Poor stack!
    
首页