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.util.*;
import java.io.*;
import java.util.Queue;
import java.util.LinkedList;
import java.math.*;
 
     public class Solution implements Runnable
    { 
          
          
          public  static void solve()
          {   
            String s=s();
            int k = i();
            char[] ch =s.toCharArray();
            int ss = 0;
            int kk=0;
            int j=-1;
            for (int i=0;i<ch.length;i++) {
              if(ch[i]=='?') ss++;
              if(ch[i]=='*') {
                kk++;
                j=i;
              }
            }
            
           
            if ((ch.length-ss) < k && kk==0) {
              
                System.out.println("Impossible");
              
            } else if (ch.length - 2*(ss+kk)>k){
                System.out.println("Impossible");
            }else {
              String ans ="";
              
              if (ch.length -(ss+kk) <k) {
              int count =k-(ch.length-(ss+kk));
            
              for (int i=0;i<ch.length;i++) {
                if (i==j){
                  for (int m=0;m<count;m++){
                    ans = ans + ch[i-1];
                  }
                  continue;
                }
                if(ch[i]=='?' || ch[i] == '*')continue;
                ans = ans + ch[i];
              }
              } else {
                
                int count = (ch.length-(ss+kk)) -k;

                for (int i=0;i<ch.length;i++) {
                  
                  if(i<ch.length-1 && (ch[i+1]=='?' || ch[i+1] == '*') && count >0) {
                    count--;
                    continue;
                  } 
                  if (ch[i]=='?' || ch[i]=='*') {continue;}
                  ans = ans + ch[i]  ;
                }

              }
              System.out.println(ans);
              
              }
            
	   
            
          }
           
          public void run()
          {   
              solve();
              out.close();
          }
 
          public static void main(String[] args) throws IOException
          { 
                new Thread(null, new Solution(), "whatever", 1<<26).start();
          }
         abstract static class Pair implements Comparable<Pair>
         {
            long a;
            int b;
            
            Pair(){}
            Pair(long a,int b)
            {
                       this.a=a;
                       this.b=b;
            }
   
            public int compareTo(Pair x)
           {
                return Long.compare(x.a,this.a);
           }
        }
        
       
         
    ////////////////////////////////////////////////////// Merge Sort ////////////////////////////////////////////////////////////////////////
     
   static class Merge 
   {
 
        public static void sort(long inputArr[]) 
        {
            int length = inputArr.length;
            doMergeSort(inputArr,0, length - 1);
        }
 
        private static void doMergeSort(long[] arr,int lowerIndex, int higherIndex) 
        {        
            if (lowerIndex < higherIndex) {
                int middle = lowerIndex + (higherIndex - lowerIndex) / 2;
                doMergeSort(arr,lowerIndex, middle);
                doMergeSort(arr,middle + 1, higherIndex);
                mergeParts(arr,lowerIndex, middle, higherIndex);
            }
        }
 
        private static void mergeParts(long[]array,int lowerIndex, int middle, int higherIndex) 
        {
            long[] temp=new long[higherIndex-lowerIndex+1];
            for (int i = lowerIndex; i <= higherIndex; i++) 
            {
                temp[i-lowerIndex] = array[i];
            }
            int i = lowerIndex;
            int j = middle + 1;
            int k = lowerIndex;
            while (i <= middle && j <= higherIndex) 
            {
                if (temp[i-lowerIndex] < temp[j-lowerIndex]) 
                {
                    array[k] = temp[i-lowerIndex];
                    i++;
                } else {
                    array[k] = temp[j-lowerIndex];
                    j++;
                }
                k++;
            }
            while (i <= middle) 
            {
                array[k] = temp[i-lowerIndex];
                k++;
                i++;
            }
            while(j<=higherIndex)
            {
                array[k]=temp[j-lowerIndex];
                k++;
                j++;
            }
        }
 
    }
        
      
    /////////////////////////////////////////////////////////// Methods ////////////////////////////////////////////////////////////////////////
 
 
     static boolean isPal(String s)
     {
        for(int i=0, j=s.length()-1;i<=j;i++,j--)
        {
                if(s.charAt(i)!=s.charAt(j)) return false;
        }
        return true;
     }
     static String rev(String s)
     {
                StringBuilder sb=new StringBuilder(s);
                sb.reverse();
                return sb.toString();
     }
     static int gcd(int a,int b){return (a==0)?b:gcd(b%a,a);}
     static long gcdExtended(long a,long b,long[] x)
     {
 
        if(a==0){
            x[0]=0;
            x[1]=1;
            return b;
        }
        long[] y=new long[2];
        long gcd=gcdExtended(b%a, a, y);
 
        x[0]=y[1]-(b/a)*y[0];
        x[1]=y[0];
 
        return gcd;
    }
 
     boolean findSum(int set[], int n, long sum)
    {
      if (sum == 0)
         return true;
      if (n == 0 && sum != 0)
         return false;
      if (set[n-1] > sum)
         return findSum(set, n-1, sum);
      return findSum(set, n-1, sum) ||findSum(set, n-1, sum-set[n-1]);
    }
   
      public static long modPow(long base, long exp, long mod)
     {
        base = base % mod;
        long result = 1;
        while (exp > 0)
       {
            if (exp % 2 == 1) 
            {
                result = (result * base) % mod;
            }
            base = (base * base) % mod;
            exp = exp >> 1;
       }
        return result;
    }
 
    static long[] fac;
    static long[] inv;
    static long mod=(long)1e9+7;
    public static void cal() 
    {
        fac = new long[1000005];
        inv = new long[1000005];
        fac[0] = 1;
        inv[0] = 1;
        for (int i = 1; i <= 1000000; i++)
        {
            fac[i] = (fac[i - 1] * i) % mod;
            inv[i] = (inv[i - 1] * modPow(i, mod - 2, mod)) % mod;
        }
    }
 
    public static long ncr(int n, int r) 
    {
        return (((fac[n] * inv[r]) % mod) * inv[n - r]) % mod;
    }
 
 
////////////////////////////////////////// Input Reader ////////////////////////////////////////////////////////////////////////////////////////////////////
     
    static InputReader sc = new InputReader(System.in);
    static PrintWriter out= new PrintWriter(System.out);   
    
    static class InputReader {
 
          private final InputStream stream;
          private final byte[] buf = new byte[8192];
          private int curChar, snumChars;
          private SpaceCharFilter filter;
 
          public InputReader(InputStream stream) {
                  this.stream = stream;
          }
 
          public int snext()
         {
                  if (snumChars == -1)
                          throw new InputMismatchException();
                  if (curChar >= snumChars) {
                          curChar = 0;
                          try {
                                  snumChars = stream.read(buf);
                          } catch (IOException e) {
                                  throw new InputMismatchException();
                          }
                          if (snumChars <= 0)
                                  return -1;
                  }
                  return buf[curChar++];
          }
 
          public int nextInt()
         {
                  int c = snext();
                  while (isSpaceChar(c)) 
                  {
                          c = snext();
                  }
                  int sgn = 1;
                  if (c == '-')
                  {
                          sgn = -1;
                          c = snext();
                  }
                  int res = 0;
                  do {
                          if (c < '0' || c > '9')
                                  throw new InputMismatchException();
                          res *= 10;
                          res += c - '0';
                          c = snext();
                  } while (!isSpaceChar(c));
                  return res * sgn;
          }
 
          public long nextLong() 
          {
                  int c = snext();
                  while (isSpaceChar(c)) 
                  {
                          c = snext();
                  }
                  int sgn = 1;
                  if (c == '-') 
                  {
                          sgn = -1;
                          c = snext();
                  }
                  long res = 0;
                  do {
                          if (c < '0' || c > '9')
                                  throw new InputMismatchException();
                          res *= 10;
                          res += c - '0';
                          c = snext();
                  } while (!isSpaceChar(c));
                  return res * sgn;
          }
 
          public int[] nextIntArray(int n)
          {
                  int a[] = new int[n];
                  for (int i = 0; i < n; i++) 
                  {
                          a[i] = nextInt();
                  }
                  return a;
          }
 
          public long[] nextLongArray(int n)
          {
                  long a[] = new long[n];
                  for (int i = 0; i < n; i++) 
                  {
                          a[i] = nextLong();
                  }
                  return a;
          }
 
          
          public String nextLine()
         {
                  int c = snext();
                  while (isSpaceChar(c))
                          c = snext();
                  StringBuilder res = new StringBuilder();
                  do {
                          res.appendCodePoint(c);
                          c = snext();
                  } while (!isEndOfLine(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;
          }
 
          private boolean isEndOfLine(int c) 
          {
                  return c == '\n' || c == '\r' || c == -1;
          }
 
          public interface SpaceCharFilter 
          {
                  public boolean isSpaceChar(int ch);
          }
 
    }
 
    static int i()
    {
        return sc.nextInt();
    }
    static long l(){
        return sc.nextLong();
    }
    static int[] iarr(int n)
    {
        return sc.nextIntArray(n);
    }
    static long[] larr(int n)
    {
        return sc.nextLongArray(n);
    }
    static String s(){
        return sc.nextLine();
    }
  
 
 }
