Problem Description

Given an integer array $b_i$ with a length of $n$, please tell me how many exactly different increasing subsequences.

P.S. A subsequence $b_{a_i}(1 \leq i \leq k)$ is an increasing subsequence of sequence $b_i(1 \leq i \leq n)$ if and only if $1\leq a_1 < a_2 < ... < a_k \leq n$ and $ b_{a_1} < b_{a_2} < ... < b_{a_k} $.
Two sequences $a_i$ and $b_i$ is exactly different if and only if there exist at least one $i$ and $a_i \neq b_i$.

Input

Several test cases(about $5$)

For each cases, first come 2 integers, $n,k(1 \leq n \leq 100,1 \leq k \leq n)$

Then follows $n$ integers $a_i ( 0 \leq a_i \leq 10^9)$

Output

For each cases, please output an integer in a line as the answer.

3 2
1 2 2
3 2
1 2 3

2
3