Minimum Days to Read Books

Kazuma has a reading list of n books. Each book has a reading time specified in hours. Although the bookshelf has a capacity c, it does not affect the computation for the total days required to complete all books. The task is to calculate the minimum number of days Kazuma needs to finish reading all the books.

The answer is given by the formula: \(\text{days} = \sum_{i=1}^{n} t_i\), where \(t_i\) is the reading time of the i-th book.

Note that the bookshelf capacity c is provided but does not influence the result.

inputFormat

The input is given in two lines from standard input.

• The first line contains two space-separated integers: n (the number of books) and c (the capacity of the bookshelf).
• The second line contains n space-separated integers representing the reading times t1, t2, ..., tn for each book.

outputFormat

Output a single integer that represents the minimum number of days required to read all the books. This value is simply the sum of all the reading times.

## sample

6 2
2 3 1 4 5 6

21

</p>