Team Formation

You are given two positive integers \(n\) and \(k\). \(n\) represents the total number of employees and \(k\) is the size of each team. Your task is to determine the maximum number of teams that can be formed using exactly \(k\) members for each team and also compute the number of employees who remain as reserves (i.e., cannot be assigned to any team).

More formally, if you form \(t = \lfloor \frac{n}{k} \rfloor\) teams, then the number of reserve employees is \(r = n \bmod k\). You need to output the values of \(t\) and \(r\) separated by a space.

Input/Output Format: The problem is interactive through standard input (stdin) and standard output (stdout). Read the input, process it, and then print the result.

inputFormat

The input consists of a single line containing two space-separated integers \(n\) and \(k\), where \(n\) is the total number of employees and \(k\) is the required team size.

outputFormat

Output a single line containing two space-separated integers: the maximum number of teams that can be formed and the number of reserve employees.

10 3

3 1