Taco Sequence Maximum Length

You are given two integers \( n \) and \( k \), where \( n \) represents the total number of digits available and \( k \) represents the maximum number of times any single digit (from 0 to 9) can appear in a sequence. Since there are only 10 unique digits, the maximum length of a sequence you can create under these constraints is:

\( \text{max_length} = 10 \times k \)

Note that the value of \( n \) does not affect the result because regardless of the total number of digits available, you are limited by the fact that you have only 10 unique digits each of which can occur at most \( k \) times.

inputFormat

The input consists of a single line with two space-separated integers \( n \) and \( k \). \( n \) is the total number of available digits (although it does not affect the answer), and \( k \) is the maximum number of times any single digit can be used.

For example:

10 2

outputFormat

Output a single integer representing the maximum length of the sequence that can be generated, which is given by \( 10 \times k \).

For example, for an input of 10 2, the output should be 20.

10 2

20