---

import sys

def solve():
    data = sys.stdin.read().split()
    if not data:
        return
    N = int(data[0])
    K = int(data[1])

    res = []

    def dfs(s):
        if len(s) == N:
            res.append(s)
            return
        d = int(s[-1])
        nxt = d - K
        if nxt >= 0:
            dfs(s + str(nxt))
        nxt = d + K
        if nxt <= 9 and K != 0:
            dfs(s + str(nxt))

    for i in range(1, 10):
        dfs(str(i))

    sys.stdout.write("\n".join(res) + "\n")

if __name__ == "__main__":
    solve()