Problem: The city administration of IT City decided to fix up a symbol of scientific and technical progress in the city's main square, namely an indicator board that shows the effect of Moore's law in real time.

Moore's law is the observation that the number of transistors in a dense integrated circuit doubles approximately every 24 months. The implication of Moore's law is that computer performance as function of time increases exponentially as well.

You are to prepare information that will change every second to display on the indicator board. Let's assume that every second the number of transistors increases exactly 1.000000011 times.

Input

The only line of the input contains a pair of integers n (1000 ≤ n ≤ 10 000) and t (0 ≤ t ≤ 2 000 000 000) — the number of transistors in the initial time and the number of seconds passed since the initial time.

Output

Output one number — the estimate of the number of transistors in a dence integrated circuit in t seconds since the initial time. The relative error of your answer should not be greater than 10 - 6.

Examples

Input

1000 1000000


Output

1011.060722383550382782399454922040

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashSet;
import java.util.Hashtable;
import java.util.LinkedList;
import java.util.Queue;
import java.io.IOException;
import java.io.InputStream;
import java.util.StringTokenizer;

public class Main {
	
	public static void main(String args[])throws IOException{
		PrintWriter out = new PrintWriter(System.out,true);
        Scanner in = new Scanner();  
        int n =in.nextInt();
        int t = in.nextInt();
        
        double x=Math.pow(1.000000011,t);
        System.out.println(x*n);
       
	}
	
	public static int fact(int n){
		int ans=1;
		for(int i=1;i<=n;i++){
			ans=ans*i;
		}
		return ans;
	}
	public static int comb(int n,int k){
		return (fact(n)/(fact(k)*fact(n-k)));
	}
	
	    static class Scanner {

	        BufferedReader br;
	        StringTokenizer st;

	        public Scanner() throws FileNotFoundException {
	            // System.setOut(new PrintStream(new BufferedOutputStream(System.out), true));
	            br = new BufferedReader(new InputStreamReader(System.in));
	            //  br = new BufferedReader(new InputStreamReader(new FileInputStream(new File("input.txt"))));
	        }

	        public String next() {

	            while (st == null || !st.hasMoreTokens()) {
	                try {
	                    st = new StringTokenizer(br.readLine());
	                } catch (Exception e) {
	                    throw new RuntimeException();
	                }
	            }
	            return st.nextToken();
	        }

	        public long nextLong() {
	            return Long.parseLong(next());
	        }

	        public int nextInt() {
	            return Integer.parseInt(next());
	        }

	        public double nextDouble() {
	            return Double.parseDouble(next());
	        }

	        public String nextLine() {
	            st = null;
	            try {
	                return br.readLine();
	            } catch (Exception e) {
	                throw new RuntimeException();
	            }
	        }

	        public boolean endLine() {
	            try {
	                String next = br.readLine();
	                while (next != null && next.trim().isEmpty()) {
	                    next = br.readLine();
	                }
	                if (next == null) {
	                    return true;
	                }
	                st = new StringTokenizer(next);
	                return st.hasMoreTokens();
	            } catch (Exception e) {
	                throw new RuntimeException();
	            }
	        }
	    }

}