Unique Problem Sets Preparation

In this problem, the organizer needs to prepare unique problem sets for a programming contest. There are n participants and each participant must receive a set of m problems. In order to ensure every participant has a unique combination of problems, you must determine the minimum number of distinct problems required.

The answer is given by the formula: \( n \times m \).

inputFormat

The input consists of a single line containing two space-separated integers: n (the number of participants) and m (the number of problems per participant).

outputFormat

Output a single integer which is the minimum number of distinct problems required to create unique problem sets for all participants.

5 3

15