#MTHA0000007. Chia nhóm (Forming Groups)

Chia nhóm (Forming Groups)

Forming Groups

Version: Phuoc Hung OJ Extended

Problem Statement

There are NN students. A teacher forms as many complete groups of exactly KK students as possible. Some students may remain. Determine the number of complete groups and the number of remaining students.

Input

One line contains two positive integers NN and KK.

Output

Print two integers: the number of complete groups and the number of remaining students.

Subtasks

  • Subtask 1 (30 points):
    • 1≤N≤1061 \le N \le 10^6.
    • 1≤K≤1061 \le K \le 10^6.
  • Subtask 2 (70 points):
    • 1≤N≤10181 \le N \le 10^{18}.
    • 1≤K≤10181 \le K \le 10^{18}.

Examples

Example 1

Input

29 6

Output

4 5

Explanation

Four groups use 4⋅6=244\cdot6=24 students, leaving 29−24=529-24=5 students.

Example 2

Input

36 6

Output

6 0

Explanation

36=6⋅636=6\cdot6, so there are 66 complete groups and no remainder.

Example 3

Input

5 9

Output

0 5

Explanation

5<95<9, so no complete group can be formed and all 55 students remain.