Problem: Today, the memorable AtCoder Beginner Contest 100 takes place. On this occasion, Takahashi would like to give an integer to Ringo.
As the name of the contest is AtCoder Beginner Contest 100, Ringo would be happy if he is given a positive integer that can be divided by 100 exactly D times.

Find the N-th smallest integer that would make Ringo happy.

Constraints

* D is 0, 1 or 2.
* N is an integer between 1 and 100 (inclusive).

Input

Input is given from Standard Input in the following format:


D N


Output

Print the N-th smallest integer that can be divided by 100 exactly D times.

Examples

Input

0 5


Output

5


Input

1 11


Output

1100


Input

2 85


Output

850000

Solution (in JAVA):

Solution:
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int D = sc.nextInt();
		int N = sc.nextInt();
		
		int[] A = new int[N + 2];
		
		for(int i = 1; i <= N + 1; i++) {
			if(i < 100) {
				A[i] = (int)(Math.pow(100, D) * i);
			} else if( i == 101) {
				A[i - 1] = (int)(Math.pow(100, D) * i);
			}
		}
		System.out.println(A[N]);
	}
}