Problem
The Duke of Cyclone, possessing unlimited power, which is reflected in his motto "I can do anything!", annually holds a competition among those invited to fulfill their most cherished desire.
The selection is carried out as follows: all applicants are seated on numbered chairs (the numbering of chairs starts from 1) around the Big Round Table, after which the countdown starts clockwise by means of
Counting constant.
The applicant who falls
Count Constants must vacate the seat, the count continues until there are two people left.
Given the known number of guests
N and
Counting constants С, it is required to determine the numbers of chairs that need to be occupied in order to be among these two "lucky ones".
Input
The first line contains the number
N (
\(1<=N<=100\)) - the number of invited applicants. In on the second line, enter
Count constants (
\(С<=100\)).
Imprint
It is necessary to print two numbers separated by a space - the numbers of the "lucky" chairs.
Examples
Запрещенные операторы: insert; pop; del; remove; index