Not a subsequence

In this problem, an alphabet of size $k$ means the first $k$ characters of the list below.

a, b, c, ..., z, A, B, C, ..., Z, 0, 1, ..., 9

Each test case gives its own $k$, and only the alphabet of size $k$ is considered.

A string $t[1..m]$ is a subsequence of a string $s[1..n]$ if there are indices $1 \le i_1 < i_2 < \cdots < i_m \le n$ with $t[1] = s[i_1]$, $t[2] = s[i_2]$, ..., $t[m] = s[i_m]$. For example, acb is a subsequence of babcaab.

Given a string $s[1..n]$, find the smallest $m$ for which some string $t[1..m]$ is not a subsequence of $s$, then count how many such strings there are. The string $t$ uses only characters of the alphabet of size $k$.

The first line has the number of test cases $T$ ($1 \le T \le 100$). Each of the following lines has the alphabet size $k$ ($1 \le k \le 62$) and a string $s[1..n]$ ($1 \le n \le 10^6$), separated by a space. $s$ uses only characters from the list above.

For each test case, print two integers on one line. The first integer is the smallest $m$. The second integer is the number of such strings $t[1..m]$ modulo $10^9 + 7$.