Bottle Cap Cash Coupon Exchange

A local convenience store has launched an event: for every \(a\) bottle caps, you can exchange them for a cash coupon worth \(5\) yuan. Xiao X has \(n\) bottle caps and plans to exchange all of them. Your task is to calculate the maximum cash coupon value (in yuan) he can obtain, as well as the number of bottle caps he will have left after the exchange.

inputFormat

The input consists of two positive integers \(n\) and \(a\) separated by a space. \(n\) represents the number of bottle caps, and \(a\) is the number of caps required for one exchange.

outputFormat

Output two integers separated by a space. The first integer is the maximum cash coupon value (in yuan) obtained, and the second integer is the number of bottle caps remaining after the exchange.

sample

10 3

15 1