Even Task Distribution

You are given two integers \(N\) and \(K\) representing the number of participants and the number of tasks respectively. The goal is to determine if it is possible to distribute \(K\) tasks among \(N\) participants as evenly as possible.

Specifically, let \(q = \lfloor K/N \rfloor\) and \(r = K \bmod N\). This implies that \(N - r\) participants will receive \(q\) tasks and \(r\) participants will receive \(q+1\) tasks. However, if \(K < N\), it is impossible to assign at least one task to each participant, and you should output NO.

Your task is to implement a solution that reads the input values from stdin and prints the correct result to stdout as described.

inputFormat

The input consists of a single line containing two space-separated integers: \(N\) (the number of participants) and \(K\) (the number of tasks), where \(1 \leq N, K \leq 10^9\).

outputFormat

If it is impossible to distribute the tasks such that each participant receives at least one task, print NO. Otherwise, print two space-separated integers. The first integer is the number of participants who receive \(q+1\) tasks, and the second integer is the number of participants who receive \(q\) tasks.

3 9

0 3