第二个点神奇RE。

#include<bits/stdc++.h>

using namespace std;
using pii = pair<int, int>;

const int N = 1e1 + 5;

int q, n, m;
string t, s[N];
vector<pii> inter, ans;

string sub(int l, int r){
  string res = "";
  for(int i = l; i <= r; i++){
    res += t[i];
  }
  return res;
}

void Clear(){
  inter.clear();
  ans.clear();
}

void solve(){
  cin >> t >> n;
  m = t.size();
  Clear();
  for(int i = 1; i <= n; i++){
    cin >> s[i];
  }
  for(int i = 1; i <= n; i++){
    for(int j = 0; j <= m - s[i].size(); j++){
      if(sub(j, j + s[i].size() - 1) == s[i]){
        inter.push_back({j, i});
      }
    }
  }
  sort(inter.begin(), inter.end());
  pii p;
  for(int r = -1, mx = 0, j = 0; r < m - 1; ){
    bool flag = 0;
    for(; j < inter.size() && inter[j].first <= r + 1; j++){
      flag = 1;
      pii x = inter[j];
      if(x.first + s[x.second].size() - 1 >= mx){
        mx = x.first + s[x.second].size() - 1;
        p = x;
      }
    }
    if(!flag){
      cout << "-1\n";
      return;
    }
    ans.push_back(p);
    r = mx;
  }
  cout << ans.size() << "\n";
  for(pii x : ans){
    cout << x.second << " " << x.first + 1 << "\n";
  }
}

int main(){
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> q;
  while(q--){
    solve();
  }
  return 0;
}