Hamming Distance

Helena has generated a list of sequences:

$\begin{aligned} S^1 &=&  \[1] \\\ S^2  &=&  S^1  +  \[2]  +  S^1 \\\ S^3  &=&  S^2  +  \[3]  +  S^2 \\\ &\dots& \\\ S^m  &=&  S^{m-1}  +  \[m]  +  S^{m-1} \end{aligned}$

where $A+B$ means the concatenation of two sequences $A$ and $B$.

For a given sequence $\[a\_1,a\_2,\dots,a\_n]$, let $f(i)$ be the Hamming distance between $\[a\_1,a\_2,\dots,a\_n]$ and $\[S^m\_i, S^m\_{i+1}, \ldots, S^m\_{i+n-1}]$ ($1 \le i \le |S^m| - n + 1)$. 

Helena would like to find the minimum value of $f(i)$ and the sum of $f(i)$ modulo $(10^9+7)$.

Note that the Hamming distance between two sequences of equal length is the number of positions at which the corresponding elements are different.

The input consists of several test cases terminated by end-of-file.

The first line contains two integers $n$ and $m$.

The second line contains $n$ integers $a\_1, a\_2, \ldots, a\_n$.

For each test case, output two integers denoting the minimum value of $f(i)$ and the sum of $f(i)$ modulo $(10^9+7)$.

• $1 \le m \leq 10^5$
• $1 \leq n \leq \min(|S^m|, 10^5)$
• $1 \leq a\_i \leq m$
• The sum of $n$ does not exceed $2 \times 10^6$.