Minimum Tasks for Badge Collection

You are given three integers representing the number of Gold, Silver, and Bronze badges that you must collect. Each Gold badge requires 100 tasks, each Silver badge requires 50 tasks, and each Bronze badge requires 20 tasks. However, you only need to complete enough tasks to satisfy the badge that requires the most tasks, since tasks completed can count toward all badge types simultaneously.

Your task is to compute the minimum number of tasks needed to meet all three badge requirements. Formally, if the required badges are given by \( g \), \( s \), and \( b \), then the answer is given by:

\[ \text{answer} = \max(100 \times g, 50 \times s, 20 \times b)\]

Print the computed result to standard output.

inputFormat

The input consists of a single line containing three space-separated integers: \( g \) (the number of Gold badges), \( s \) (the number of Silver badges), and \( b \) (the number of Bronze badges).

outputFormat

Output a single integer which is the minimum number of tasks required to obtain the desired badges.

## sample

2 3 1

200

</p>