Integer Division with Remainder

Problem Background

Special for beginners, ^_^

Problem Description

Given a dividend and a divisor, compute the integer quotient and the remainder.

For this problem, simply use the default integer-division and modulo operations; no special handling of the results is needed. See how the program's behaviour differs from the mathematical definition?

Input Format

A single line containing two integers, the dividend and the divisor (the divisor is non-zero), separated by a single space.

Output Format

A single line containing two integers, the integer quotient and the remainder, separated by a single space.

Sample Input

10 3

Sample Output

3 1

Constraints

1s, 1024KiB for each test case.

Hint

• / gives the quotient, % gives the remainder; both are integer operators.
• Output the two results on one line, separated by a space.
• Check against the sample: 10 3 → 3 1.