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: 

<image>

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. 

<image>

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 k letters. Help him to find out if a given string can encode a message of k letters, 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 200.

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

Output

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

Examples

Input


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


Output


happynewyear


Input


ab?a
2


Output


aa

Input


ab?a
3


Output


aba

Input


ababb
5


Output


ababb

Input


ab?a
1


Output


Impossible
	import java.io.BufferedWriter;
	import java.io.IOException;
	import java.io.InputStream;
	import java.io.OutputStream;
	import java.io.OutputStreamWriter;
	import java.io.PrintWriter;
	import java.io.Writer;
	import java.util.Arrays;
	import java.util.InputMismatchException;
	import java.util.*;
	import java.io.*;
	import java.math.*;
	public class Main55{

	static class Pair
		{ 
			int x; 
			int y; 
			//int z;
			public Pair(int x, int y) 
			{	 
				this.x = x; 
				this.y = y; 
				
			}	 
		} 
		static class Compare
		{ 
			static void compare(Pair arr[], int n) 
			{ 
				// Comparator to sort the pair according to second element 
				Arrays.sort(arr, new Comparator<Pair>() { 
					@Override public int compare(Pair p1, Pair p2) 
					{ 
						return p1.x - p2.x; 
					} 
				}); 
			} 
		}
		public static long pow(long a, long b)
		{
			long result=1;
			while(b>0)
			{
				if (b % 2 != 0)
				{
					result=(result*a)%(mod);
					b--;
				} 
				a=(a*a)%(mod);
				b /= 2;
			}   
			return result;
		}
		public static long fact(long num)
		{
					long value=1;
					int i=0;
					for(i=2;i<num;i++)
					{
						value=((value%mod)*i%mod)%mod;
					}
					return value;
				}
				public static long gcd(long a, long b)
				{
					if (a == 0)
						return b;
					return gcd(b%a, a);
				}
				
				public static long lcm(int a,int b)
				{
					return a * (b / gcd(a, b));
				}
				public static long sum(int h)
				{
					return (h*(h+1)/2);
				}
				public static void dfs(int parent,boolean[] visited,boolean[] Stack)
				{
					ArrayList<Integer> arr=new ArrayList<Integer>();
					arr=graph.get(parent);
					if(Stack[parent]==true)
					{
						f=1;
						return;
					}
					visited[parent]=true;
					Stack[parent]=true;
				//	count[ch[parent]-'a']++;
					for(int i=0;i<arr.size();i++)
					{
						int num=arr.get(i);
						if(visited[num]==false)
						{
							dfs(num,visited,Stack);
						}
						else
						{
							if(Stack[num]==true)
							{
								f=1;
								return;
							}  
						}
					}
					Stack[parent]=false;
				}
			//	static int[] count;
				static int f=0;
				static char[] ch;
				static long mod=998244353L;
				static ArrayList<ArrayList<Integer>> graph;
				public static void main(String args[])throws IOException
				{
					InputReader in=new InputReader(System.in);
					OutputWriter out=new OutputWriter(System.out);
				//	long a=pow(26,1000000005);
				//    BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
					ArrayList<Integer> ar=new ArrayList<>();
					ArrayList<Integer> ar1=new ArrayList<>();
					ArrayList<Integer> ar2=new ArrayList<>();
					ArrayList<Integer> ar3=new ArrayList<>();
					ArrayList<Integer> ar4=new ArrayList<>();
					TreeSet<Integer> ts=new TreeSet<>();
					TreeSet<Integer> ts1=new TreeSet<>();
					TreeSet<String> pre=new TreeSet<>();
					HashMap<Integer,Integer> hash=new HashMap<>();
					HashMap<Long,Integer> hash1=new HashMap<Long,Integer>();
					HashMap<Long,Integer> hash2=new HashMap<Long,Integer>();
				/*	boolean[] prime=new boolean[100001];
					for(int i=2;i*i<=100000;i++)
					{
						if(prime[i]==false)
						{
							for(int j=2*i;j<=100000;j++)
							{
								prime[j]=true;
							}
						}
					}*/
					String s=s();
					int k=i();
					int n=s.length();
					for(int i=0;i<n;i++)
					{
						if(s.charAt(i)=='?')
						{
							ar.add(i);
							ts.add(i);
						}
						else if(s.charAt(i)=='*')
						{
							ar1.add(i);
							ts1.add(i);
						}
					}
					if(ar1.size()==0)
					{
						if(n-ar.size()<k)
						{
							pln("Impossible");
						}
						else if(n-ar.size()-ar.size()>k)
						{
							pln("Impossible");
						}
						else
						{
							int req=n-ar.size()-k;
							int l=0,count=0;
							char[] ch=new char[k];
							for(int i=0;i<n;i++)
							{
								if(ts.contains(i+1) && count<req)
								{
									//j++;
									count++;
								}
								else if(ts.contains(i)==false)
								{
									ch[l]=s.charAt(i);
									l++;
								}
							}
							String s1=new String(ch);
							pln(s1+"");
						}
					}
					else
					{
						int num1=n-ar.size()-ar1.size();
						if(num1>k)
						{
							if(num1-ar.size()-ar1.size()>k)
							{
								pln("Impossible");
							}
							else
							{
								int req=num1-k;
								int l=0,count=0;
								char[] ch=new char[k];
								for(int i=0;i<n;i++)
								{
									if((ts.contains(i+1) || ts1.contains(i+1)) && count<req)
									{
										count++;
									}
									else
									{
										if(ts.contains(i)==false && ts1.contains(i)==false)
										{
											ch[l]=s.charAt(i);
											l++;
										}
									}
								}
								String s1=new String(ch);
								pln(s1+"");
							}
						}
						else if(num1==k)
						{
							int l=0;
							char[] ch=new char[k];
							for(int i=0;i<n;i++)
							{
								if(ts.contains(i)==false && ts1.contains(i)==false)
								{
									ch[l]=s.charAt(i);
									l++;
								}
							}
							String s1=new String(ch);
							pln(s1+"");
						}
						else if(num1<k)
						{
							int req=k-num1;
							int l=0;
							char[] ch=new char[k];
							for(int i=0;i<n;i++)
							{
								if(ts.contains(i)==false)
								{
									if(i!=ar1.get(0)-1 && ts1.contains(i)==false)
									{
										ch[l]=s.charAt(i);
										l++;
									}
									else
									{
										if(ts1.contains(i)==false)
										{
											for(int j=0;j<=req;j++)
											{
												ch[l]=s.charAt(i);
												l++;
											}
										}
									}
								}
							}
							String s1=new String(ch);
							pln(s1+"");
						}
						
					}
				}
	
				
				
				
				
				
				
				
				
				
				
				
				
				
				
				
				
				
				
				
				
				
				
				
				
				
				
				/**/
				static InputReader in=new InputReader(System.in);
					static OutputWriter out=new OutputWriter(System.out);
					public static long l()
					{
						String s=in.String();
						return Long.parseLong(s);
					}
					public static void pln(String value)
					{
						System.out.println(value);
					}
					public static int i()
					{
						return in.Int();
					}
					public static String s()
					{
						return in.String();
					}
		}
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			 
			class InputReader {
				 
				private InputStream stream;
				private byte[] buf = new byte[1024];
				private int curChar;
				private int numChars;
				private SpaceCharFilter filter;
			 
				public InputReader(InputStream stream) {
					this.stream = stream;
				}
			 
				public int read() {
					if (numChars== -1)
						throw new InputMismatchException();
					if (curChar >= numChars) {
						curChar = 0;
						try {
							numChars = stream.read(buf);
						} catch (IOException e) {
							throw new InputMismatchException();
						}
						if (numChars <= 0)
							return -1;
					}
					return buf[curChar++];
				}
			 
				public int Int() {
					int c = read();
					while (isSpaceChar(c))
						c = read();
					int sgn = 1;
					if (c == '-') {
						sgn = -1;
						c = read();
					}
					int res = 0;
					do {
						if (c < '0' || c > '9')
							throw new InputMismatchException();
						res *= 10;
						res += c - '0';
						c = read();
					} while (!isSpaceChar(c));
					return res * sgn;
				}
			 
				public String String() {
					int c = read();
					while (isSpaceChar(c))
						c = read();
					StringBuilder res = new StringBuilder();
					do {
						res.appendCodePoint(c);
						c = read();
					} while (!isSpaceChar(c));
					return res.toString();
				}
			 
				public boolean isSpaceChar(int c) {
					if (filter != null)
						return filter.isSpaceChar(c);
					return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
				}
			 
				public String next() {
					return String();
				}
			 
				public interface SpaceCharFilter {
					public boolean isSpaceChar(int ch);
				}
			}
			 
			class OutputWriter {
				private final PrintWriter writer;
			 
				public OutputWriter(OutputStream outputStream) {
					writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
				}
			 
				public OutputWriter(Writer writer) {
					this.writer = new PrintWriter(writer);
				}
			 
				public void print(Object...objects) {
					for (int i = 0; i < objects.length; i++) {
						if (i != 0)
							writer.print(' ');
						writer.print(objects[i]);
					}
				}
			 
				public void printLine(Object...objects) {
					print(objects);
					writer.println();
				}
			 
				public void close() {
					writer.close();
				}
			 
				public void flush() {
					writer.flush();
				}
			 
				}
			 
				class IOUtils {
			 
				public static int[] readIntArray(InputReader in, int size) {
					int[] array = new int[size];
					for (int i = 0; i < size; i++)
						array[i] = in.Int();
					return array;
				}
			 
				} 