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();
        long nCount = 0;
        long i = 0;
        while (true) {
            if (i % Math.pow(100,D) == 0 && i % Math.pow(100,D + 1) != 0) {
                if (N == ++nCount) {
                    break;
                }
            }
            i++;
        }
        System.out.println(i);
    }
}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz