Maximum Unique Employee Pairs

You are given two integers \( n \) and \( m \) representing the number of employees in department A and department B respectively. Your task is to determine the maximum number of unique pairs that can be formed, where each pair consists of one employee from department A and one from department B. Since an employee can only be paired once, the maximum pairs that can be formed is limited by the smaller department.

In mathematical terms, the solution is \( \min(n, m) \).

inputFormat

The input consists of two space-separated integers \( n \) and \( m \), where \( n \) is the number of employees in department A and \( m \) is the number of employees in department B.

outputFormat

Output a single integer representing the maximum number of unique pairs that can be formed.

4 5

4