#K61902. Largest Divisible Number

    ID: 31412 Type: Default 1000ms 256MiB

Largest Divisible Number

Largest Divisible Number

Given two positive integers a and b, your task is to find the largest integer less than or equal to b that is divisible by a.

The solution involves rounding down b to the nearest multiple of a. For example, if a = 3 and b = 10, the answer is 9 because 9 is the largest multiple of 3 that does not exceed 10.

Constraints: Both a and b are positive integers and it is guaranteed that b is at least as large as a.

inputFormat

The input is given via standard input and consists of two space-separated integers a and b.

outputFormat

Output a single integer: the largest integer less than or equal to b that is divisible by a.

## sample
2 8
8