K-sided domino
A standard set of dominoes consists of **28** tiles. Each tile is a rectangle divided into **2** sections, with each section displaying a number from the set {**0**, **1**, **2**, **3**, **4**, **5**, **6**}. The numbers on both sections can be identical. The set includes every possible tile, ensuring no two tiles have the same pair of numbers.
Now, consider a set of dominoes where each tile is divided into **K** sections. The numbers on these sections are selected from a specific set **A** containing **N** distinct elements. Two tiles are considered identical if the sets of numbers on them are the same, accounting for multiplicity. The set includes all possible tiles without duplicates.
Your task is to determine the total number of tiles in this set and the sum of all numbers on these tiles.
Input
The first line contains two integers, **N** and **K**. The second line lists the numbers **a_i** from the set **A** (**1** ≤ **K** ≤ **10^4**, **1** ≤ **N** ≤ **10^6**, **1** ≤ **a_i** ≤ **10^9**). All **a_i** are distinct.
Output
Output two numbers on a single line: the total number of tiles in the set and the sum of all numbers on these tiles.