#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef int (*itoi)(int);
typedef int (*iitoi)(int, int);
typedef int (*iiitoi)(int, int, int);
typedef ll (*ltol)(ll);
typedef ll (*lltol)(ll, ll);
typedef ll (*llltol)(ll, ll, ll);
const long double PI = acos(0) * 2;
const int INF = 0x3f2f1f0f;
const ll LINF = 1ll * INF * INF;
int X4[] = {-1, 0, 1, 0}, Y4[] = {0, -1, 0, 1};
int X8[] = {-1, -1, -1, 0, 1, 1, 1, 0}, Y8[] = {-1, 0, 1, 1, 1, 0, -1, -1};
template <typename T>
inline bool uax(T& a, T b) {
  return a < b ? (a = b, 1) : 0;
}
template <typename T>
inline bool uin(T& a, T b) {
  return a > b ? (a = b, 1) : 0;
}
template <typename T1, typename T2>
istream& operator>>(istream& is, pair<T1, T2>& p) {
  return is >> p.first >> p.second;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
  return os << '(' << p.first << ", " << p.second << ")";
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  for (int i = 0; i < (int)v.size(); i++) {
    os << v[i];
    if (i + 1 < (int)v.size()) os << ' ';
  }
  return os;
}
const int MAX_N = 1e6 + 20;
const ll MOD = 1e9 + 7;
ll X;
char S[MAX_N];
int P[MAX_N];
int main() {
  int q;
  cin >> q;
  while (q--) {
    cin >> X >> S;
    int n = strlen(S);
    for (int i = 1; i <= n; i++) {
      P[i] = S[i - 1] - '0';
    }
    ll len = n;
    bool filled = 0;
    for (int l = 1; l <= X; l++) {
      int r = P[l];
      if (!filled) {
        int L = l + 1, R = len;
        int p = R + 1;
        for (int __i = 0; __i < (r - 1); __i++) {
          for (int i = L; i <= R; i++) {
            P[p++] = P[i];
            if (p > X + 1) break;
          }
          if (p > X + 1) break;
        }
        if (p > X + 1) filled = 1;
      }
      len = (((len - l) * r + l) % MOD + MOD) % MOD;
    }
    cout << len << endl;
  }
  return 0;
}
