Division without dividing

You are given two integers $n$ and $k$. Find the integer quotient and the remainder of $n$ divided by $k$ without the division (/) and remainder (%) operators — only with addition and subtraction.

A single line with two integers $n$ and $k$ ($0 \le n \le 10^9$, $1 \le k \le 10^9$, the quotient is at most ).

A single line with two integers: the quotient and the remainder.

Subtract $k$ from $n$ until $n$ becomes less than $k$ — a while loop. The number of subtractions is the quotient and what is left is the remainder. In the first example: $17 \to 12 \to 7 \to 2$, three subtractions: the answer is .