Pastries Distribution

You are given two integers \(n\) and \(m\). The integer \(n\) represents the total number of pastries and \(m\) represents the number of boxes available. Your task is to determine how many pastries will be placed in each box and how many pastries will remain undistributed (leftover).

In other words, compute the quotient and the remainder when \(n\) is divided by \(m\). Formally, if the pastries are evenly distributed, then each box receives \(\lfloor\frac{n}{m}\rfloor\) pastries and the leftover pastries are \(n \bmod m\).

Input: Two integers \(n\) and \(m\).

Output: Two integers: the first is the number of pastries per box, and the second is the number of leftover pastries.

inputFormat

The input consists of a single line containing two space-separated integers \(n\) and \(m\), where \(n\) is the total number of pastries and \(m\) is the number of boxes.

outputFormat

Output two integers separated by a space: the number of pastries each box will receive and the number of leftover pastries.

10 3

3 1