Consider a sequence of positive integers . Let . The first terms are called the seed of the sequence.
For every integer , the following term is defined by
Two integers and are given. Find positive integers such that for some integer satisfying .
Every input has at least one valid seed. If several seeds are valid, print any one of them.
The input is given in the following format:
For each case, print positive integers forming a valid seed on one line, separated by spaces.
Each case is given in the following format: