func_code_string: #include <bits/stdc++.h>   using namespace std;   int main() {     ios_base::sync_with_stdio(0);     cin.tie(0);     cout.tie(0);     string base, s;     cin >> base >> s;     int n = base.size(), m = s.size();     base =  *  + base;     s =  *  + s;     int f[m + 2][n + 2];     memset(f, 0, sizeof(f));     for (int i = m; i >= 1; i--)       for (int j = n; j >= 1; j--)         if (s[i] == base[j]) f[i][j] = f[i + 1][j + 1] + 1;     int g[m + 2][n + 2];     memset(g, 0, sizeof(g));     for (int i = m; i >= 1; i--)       for (int j = 1; j <= n; j++)         if (s[i] == base[j]) g[i][j] = g[i + 1][j - 1] + 1;     vector<pair<int, int>> ans;     for (int i = 1; i <= m;) {       int l1 = max_element(f[i] + 1, f[i] + n + 1) - f[i];       int l2 = max_element(g[i] + 1, g[i] + n + 1) - g[i];       if (!f[i][l1] && !g[i][l2]) {         cout << -1;         return 0;       }       if (f[i][l1] >= g[i][l2])         ans.push_back({l1, l1 + f[i][l1] - 1});       else         ans.push_back({l2, l2 - g[i][l2] + 1});       i += max(f[i][l1], g[i][l2]);     }     cout << ans.size() <<   n ;     for (auto p : ans) cout << p.first <<     << p.second <<   n ;   }   