Codeforces 1099 C. Postcard-字符串处理(Codeforces Round #530 (Div. 2))

C. Postcard

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Andrey received a postcard from Irina. It contained only the words "Hello, Andrey!", and a strange string consisting of lowercase Latin letters, snowflakes and candy canes. Andrey thought that this string is an encrypted message, and decided to decrypt it.

Andrey noticed that snowflakes and candy canes always stand after the letters, so he supposed that the message was encrypted as follows. Candy cane means that the letter before it can be removed, or can be left. A snowflake means that the letter before it can be removed, left, or repeated several times.

For example, consider the following string:

This string can encode the message «happynewyear». For this, candy canes and snowflakes should be used as follows:

• candy cane 1: remove the letter w,
• snowflake 1: repeat the letter p twice,
• candy cane 2: leave the letter n,
• snowflake 2: remove the letter w,
• snowflake 3: leave the letter e.

Please note that the same string can encode different messages. For example, the string above can encode «hayewyar», «happpppynewwwwwyear», and other messages.

Andrey knows that messages from Irina usually have a length of kk letters. Help him to find out if a given string can encode a message of kkletters, and if so, give an example of such a message.

Input

The first line contains the string received in the postcard. The string consists only of lowercase Latin letters, as well as the characters «*» and «?», meaning snowflake and candy cone, respectively. These characters can only appear immediately after the letter. The length of the string does not exceed 200200.

The second line contains an integer number kk (1≤k≤2001≤k≤200), the required message length.

Output

Print any message of length kk that the given string can encode, or «Impossible» if such a message does not exist.

Examples

input

Copy

hw?ap*yn?eww*ye*ar
12

output

Copy

happynewyear

input

Copy

ab?a
2

output

Copy

aa

input

Copy

ab?a
3

output

Copy

aba

input

Copy

ababb
5

output

Copy

ababb

input

Copy

ab?a
1

output

Copy

Impossible

题意就是给你一个字符串，其中？可以有两种操作，1.将前面的字母放到当前位置，其实就是去掉？2.去掉前面的字母，其实就是去掉前面的字母去掉？

*的有三种操作，1.将前面的字母放到当前位置，就是去掉* 2.去掉前面的字母，就是去掉前面的字母和* 3.前面的字母可以重复任意次

假设是abc*，可以是abc，可以是ab，可以是abcccccc，就是这样的，给你一个字符串，问你能不能将字符串变成要求的长度，最后的字符串不能有？和*。

直接将纯字母的长度先找出来，然后判断再进行操作就可以了。

代码:

//C
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;
const int maxn=1e5+10;

char s[200];

int main()
{
    scanf("%s",s);
    int n;
    cin>>n;
    int len=strlen(s);
    int candy=0,snow=0;
    for(int i=0;i<len;i++){
        if(s[i]=='?') candy++;
        else if(s[i]=='*') snow++;
    }
    int l=len-candy-snow;
    if(l==n){
        for(int i=0;i<len;i++){
            if(s[i]!='?'&&s[i]!='*') cout<<s[i];
        }
        cout<<endl;
    }
    else if(l<n&&snow>0){
        int c;
        for(int i=0;i<len;i++){
            if(s[i]=='?') s[i]='#';
            if(s[i]=='*'){
                if(l<n){
                    c=n-l;
                    s[i]='!';
                    //cout<<s[i]<<endl;
                    l=n;
                }
                else{
                    s[i]='#';
                }
            }
        }
        for(int i=0;i<len;i++){
            if(s[i]!='#'){
                if(s[i]=='!'){
                    for(int j=0;j<c;j++)
                        cout<<s[i-1];
                }
                else cout<<s[i];
            }
        }
        cout<<endl;
    }
    else if(l>n&&l-(candy+snow)<=n){
        for(int i=0;i<len;i++){
            if((s[i]=='?'||s[i]=='*')&&l>n){
                s[i-1]='#';
                s[i]='#';
                l--;
            }
            else if(s[i]=='?'||s[i]=='*')
                s[i]='#';
        }
        for(int i=0;i<len;i++){
            if(s[i]!='#') cout<<s[i];
        }
        cout<<endl;
    }
    else cout<<"Impossible"<<endl;
}