solve :: [Int] -> Int
solve (d:n:_) =
    (filter (\x -> div100 d x) [1..]) !! (n - 1)

div100 :: Int -> Int -> Bool -- bが100で丁度a回割り切れるか
div100 a b = b `mod` 100^a == 0 && b `mod` 100^(a + 1) > 0

main :: IO ()
main = do
    n <- fmap (read :: String -> Int) . words <$> getLine
    (putStrLn . show . solve) n