Hash

아직 제출이 없습니다시간 제한2초메모리 제한256 MB

문제

A HAIKU is a string that consists of at most 50 lowercase English letters. For a HAIKU ss, you can compute the hash hh as follows:

h = 0
for i=0,...|s|-1
    h = (h * a + (s[i] - 'a' + 1)) % b

You are given two integers aa and bb. Construct 100 distinct HAIKUs that have the same hash.

입력

You are given two space-separated integers aa and bb (b109b \le 10^9, 26a<b26 \le a < b).

출력

Print 100 HAIKUs with the same hash, one per line.

힌트

Several HAIKUs are omitted in the printed version of statements; the full version is published in the contest system.