import java.util.*;
// Word by word ripped from editorial solution. 
// Completes first 100th incomplete atcoder ABC submission. 
// Atcoder is awesome.. 
public class Main {

	static int calc(int x) {
		int ret = 0;
		while (x%100==0) {
			x/=100;
			++ret;
		}
		return ret;
	}

	static void solve() {
		Scanner sc = new Scanner(System.in);
		int D = sc.nextInt(), N = sc.nextInt(), cnt=0, val=0;
		while (cnt<N) {
			++val;
			if (calc(val)==D) ++cnt;
		}
		System.out.println(val);
		sc.close();			
	}

	public static void main(String args[]) {
		solve();
	}

} import java.util.*; util.* java public class Main {

	static int calc(int x) {
		int ret = 0;
		while (x%100==0) {
			x/=100;
			++ret;
		}
		return ret;
	}

	static void solve() {
		Scanner sc = new Scanner(System.in);
		int D = sc.nextInt(), N = sc.nextInt(), cnt=0, val=0;
		while (cnt<N) {
			++val;
			if (calc(val)==D) ++cnt;
		}
		System.out.println(val);
		sc.close();			
	}

	public static void main(String args[]) {
		solve();
	}

} Main static int calc(int x) {
		int ret = 0;
		while (x%100==0) {
			x/=100;
			++ret;
		}
		return ret;
	} calc {
		int ret = 0;
		while (x%100==0) {
			x/=100;
			++ret;
		}
		return ret;
	} int ret = 0; ret 0 while (x%100==0) {
			x/=100;
			++ret;
		} x%100==0 x%100 x 100 0 {
			x/=100;
			++ret;
		} x/=100 x 100 ++ret ret return ret; ret int x x static void solve() {
		Scanner sc = new Scanner(System.in);
		int D = sc.nextInt(), N = sc.nextInt(), cnt=0, val=0;
		while (cnt<N) {
			++val;
			if (calc(val)==D) ++cnt;
		}
		System.out.println(val);
		sc.close();			
	} solve {
		Scanner sc = new Scanner(System.in);
		int D = sc.nextInt(), N = sc.nextInt(), cnt=0, val=0;
		while (cnt<N) {
			++val;
			if (calc(val)==D) ++cnt;
		}
		System.out.println(val);
		sc.close();			
	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int D = sc.nextInt() D sc.nextInt() sc.nextInt sc N = sc.nextInt() N sc.nextInt() sc.nextInt sc cnt=0 cnt 0 val=0; val 0 while (cnt<N) {
			++val;
			if (calc(val)==D) ++cnt;
		} cnt<N cnt N {
			++val;
			if (calc(val)==D) ++cnt;
		} ++val val if (calc(val)==D) ++cnt; calc(val)==D calc(val) calc val D ++cnt cnt System.out.println(val) System.out.println System.out System System.out val sc.close() sc.close sc public static void main(String args[]) {
		solve();
	} main {
		solve();
	} solve() solve String args[] args public class Main {

	static int calc(int x) {
		int ret = 0;
		while (x%100==0) {
			x/=100;
			++ret;
		}
		return ret;
	}

	static void solve() {
		Scanner sc = new Scanner(System.in);
		int D = sc.nextInt(), N = sc.nextInt(), cnt=0, val=0;
		while (cnt<N) {
			++val;
			if (calc(val)==D) ++cnt;
		}
		System.out.println(val);
		sc.close();			
	}

	public static void main(String args[]) {
		solve();
	}

} public class Main {

	static int calc(int x) {
		int ret = 0;
		while (x%100==0) {
			x/=100;
			++ret;
		}
		return ret;
	}

	static void solve() {
		Scanner sc = new Scanner(System.in);
		int D = sc.nextInt(), N = sc.nextInt(), cnt=0, val=0;
		while (cnt<N) {
			++val;
			if (calc(val)==D) ++cnt;
		}
		System.out.println(val);
		sc.close();			
	}

	public static void main(String args[]) {
		solve();
	}

} Main
import java.util.*;
// Word by word ripped from editorial solution. 
// Completes first 100th incomplete atcoder ABC submission. 
// Atcoder is awesome.. 
public class Main {

	static int calc(int x) {
		int ret = 0;
		while (x%100==0) {
			x/=100;
			++ret;
		}
		return ret;
	}

	static void solve() {
		Scanner sc = new Scanner(System.in);
		int D = sc.nextInt(), N = sc.nextInt(), cnt=0, val=0;
		while (cnt<N) {
			++val;
			if (calc(val)==D) ++cnt;
		}
		System.out.println(val);
		sc.close();			
	}

	public static void main(String args[]) {
		solve();
	}

}