Taco's Magical Stones

You are given a collection of magical stones. Each stone has a given magical power. Your task is to compute the highest possible total magical power you can obtain by summing all the stones' powers. The first input line contains two integers \(n\) and \(m\), where \(n\) is the number of stones and \(m\) is an additional parameter (unused in the calculation). The second line contains \(n\) non-negative integers representing the power of each stone.

Formally, if the power levels are \(a_1, a_2, \ldots, a_n\), you need to output the sum \(\sum_{i=1}^{n} a_i\). Note that even if \(m\) is provided, it does not affect the result.

Example:

Input:
4 2
1 2 3 4
Output:
10

</p>

inputFormat

The input is given via stdin. The first line contains two integers \(n\) and \(m\) separated by a space. The second line contains \(n\) space-separated integers depicting the power levels of the stones. If \(n = 0\), then no additional numbers follow.

outputFormat

Print a single integer representing the sum of the power levels of the stones to stdout.

## sample

4 2
1 2 3 4

10

</p>