Description

Given two decimal integers $n, s$, find the first $n$ decimal numbers greater than $s$ that are palindromic in at least two bases among base $2$ through base $10$, and output them.

A solution to this problem does not need integers wider than $32$ bits.

Input Format

One line containing two positive integers $n, s$ separated by a space.

Output Format

Output $n$ lines. Each line contains one number that satisfies the requirement, in ascending order.

3 25

26
27
28

Hint

Constraints
For $100\%$ of the testdata, $1 \le n \le 15$, $1 \le s \le 9999$.

Problem translation from NOCOW.

USACO Training Section 1.2.

Translated by ChatGPT 5