//  Nikita Golikov, 2023

#include <bits/stdc++.h>

using namespace std;

using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;

#ifdef GOLIKOV
  #include "/Users/golikovnik/contests/debug.h"
#else
  #define debug(...) ;
#endif

template <class A, class B>
bool smin(A& x, B&& y) {
  if (y < x) {
    x = y;
    return true;
  }
  return false;
}

template <class A, class B>
bool smax(A& x, B&& y) {
  if (x < y) {
    x = y;
    return true;
  }
  return false;
}

void solveTest() {
  int n, k;
  cin >> n >> k;
  vector<string> a(n);
  for (auto& s : a) {
    cin >> s;
  }
  string t; cin >> t;
  ll const INF = ll(1e18);
  vector<ll> forRem(k, INF);
  for (auto& s : a) {
    smin(forRem[int(s.size()) % k], int(s.size()));
  }
  vector<int> vals;
  for (int i = 0; i < k; ++i) {
    if (forRem[i] != INF) {
      vals.push_back(i);
    }
  }
  vector<ll> dp(k, INF);
  dp[0] = 0;
  vector<bool> used(k);
  priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<>> pq;
  pq.emplace(0, 0);
  while (!pq.empty()) {
    auto[score, p] = pq.top(); pq.pop();
    if (used[p]) {
      continue;
    }
    used[p] = true;
    for (int t : vals) {
      int go = (t + p) % k;
      if (smin(dp[go], score + forRem[t] + k)) {
        pq.emplace(dp[go], go);
      }
    }
  }
  struct node {
    int nxt[26]{};
    ll bestScore = INF;
  };
  vector<node> tree;
  tree.emplace_back();
  for (auto& s : a) {
    int cur = 0;
    int len = 0;
    for (char ch : s) {
      ch -= 'a';
      if (!tree[cur].nxt[ch]) {
        tree[cur].nxt[ch] = int(tree.size());
        tree.emplace_back();
      }
      cur = tree[cur].nxt[ch];
      len++;
      int left = int(s.size()) - len;
      auto val = dp[(k - left % k) % k];
      if (val != INF) {
        assert((val + left) % k == 0);
        smin(tree[cur].bestScore, (val + left) / k);
      }
    }
  }
  int m = int(t.size());
  vector<ll> dpAns(m + 1, INF);
  dpAns[0] = 0;

  for (int p = 0; p < m; ++p) {
    int cur = 0;
    for (int q = p; q < m; ++q) {
      int here = t[q] - 'a';
      if (!tree[cur].nxt[here]) {
        break;
      }
      cur = tree[cur].nxt[here];
      smin(dpAns[q + 1], dpAns[p] + 1 + tree[cur].bestScore);
    }
  }

  cout << (dpAns[m] == INF ? -1 : dpAns[m]) << '\n';
}

int main() {
#ifdef GOLIKOV
  assert(freopen("in", "rt", stdin));
  auto _clock_start = chrono::high_resolution_clock::now();
#endif
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int tests_;
  cin >> tests_;
  for (int tt_ = 1; tt_ <= tests_; ++tt_) {
    solveTest();
  }

#ifdef GOLIKOV
  cerr << "Executed in " << chrono::duration_cast<chrono::milliseconds>(
      chrono::high_resolution_clock::now()
          - _clock_start).count() << "ms." << endl;
#endif
  return 0;
}