Taco Problem Distribution

Tom wants to distribute \( n \) coding problems among \( m \) participants as fairly as possible. The distribution follows this rule:

Let \( k = \left\lfloor \frac{n}{m} \right\rfloor \). If \( k > 0 \), then each of the \( m \) participants receives \( k \) problems. Otherwise, if \( k = 0 \), only \( n \) participants are considered (each receiving 0 problems).

Given two positive integers \( n \) and \( m \), determine the number of participants who will receive problems and the number of problems each will get.

inputFormat

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

outputFormat

Output two space-separated integers: the first is the number of participants who will receive problems, and the second is the number of problems each of these participants will get.## sample

10 3

3 3