[오늘의 BOJ] 3553

ㅎㅎㅎ 오우 쉣

import sys
n,d = map(int, sys.stdin.readline().split())

def dragon(n, d):
  small= (10 ** (n-1))
  big = (10 ** n)

  for i in range(small, big):
    if i % d == 0:
      return i
  return "No solution"
print(dragon(n,d))