Корась

#pragma comment(linker, "/STACK:66777216")

#include <iostream>
#include <cstdio>

#include <functional>
#include <utility>
#include <cmath>
#include <algorithm>
#include <cassert>

#include <vector>
#include <set>
#include <queue>
#include <map>
#include <stack>
#include <unordered_map>

#include <string>
#include <iterator>
#include <iomanip>
#include <fstream>

#include <random>
#include <chrono>

using namespace std;

#define uint unsigned int
#define prll pair<ll,ll>
#define prdd pair<double,double>
#define m_p make_pair
#define ticonst (ll)1337228
#define INF (ll)1e18
#define ll int

const ll q = 239017;
const ll mod = 1e9 + 7;
const ll mod2 = 1e9 + 13;
const ll MAXN = 1e6 + 100;
const ll MAXM = 4294967291;
const ll L = 26;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// if(clock() / (double)CLOCKS_PER_SEC >= t.0)

/*
niyaz,your nose like garden hose!
 🐊🔧🐊🔧🐊🔧🐊🔧🐊🔧🐊🔧
*/


vector<ll> rs[MAXN];
ll sz[MAXN];

struct Node
{
    //Node *to[26] = {}, *go[26] = {};
    bitset <ll, Node*> to, go;

    bool t = 0;
    vector<ll> term;

    Node *p, *link = 0, *tlink = 0;
    ll pc;

    Node(Node *v, ll c)
    {
        p = v;
        pc = c;
    }

};

Node *root = new Node(0, -1);

void add(string &s, ll id)
{
    auto v = root;

    for (auto el : s)
    {
        ll c = el - 'a';

        if (!v->to[c])
            v->to[c] = new Node(v, c);

        v = v->to[c];
    }

    v->t = 1;
    v->term.push_back(id);
}

Node *_go(Node *v, ll c);

Node *_link(Node *v)
{
    if (!v->link)
    {
        if (v == root || v->p == root)
            v->link = root;
        else
            v->link = _go(_link(v->p), v->pc);
    }

    return v->link;
}

Node *_go(Node *v, ll c)
{
    if (!v->go[c])
    {
        if (v->to[c])
            v->go[c] = v->to[c];
        else if (v == root)
            v->go[c] = root;
        else
            v->go[c] = _go(_link(v), c);
    }

    return v->go[c];
}

Node *_tlink(Node *v)
{
    if (!v->tlink)
    {
        Node *u = _link(v);

        v->tlink = (u == root || u->t ? u : _tlink(u));
    }

    return v->tlink;
}

void $main()
{
    string s; cin >> s;

    ll m = (ll)s.size();

    ll n; cin >> n;
    for (ll i = 1; i <= n; ++i)
    {
        string str; cin >> str;
        add(str, i);

        sz[i] = (ll)str.size();
    }

    auto v = root;
    for (ll i = 0; i < m; ++i)
    {
        ll c = s[i] - 'a';

        v = _go(v, c);

        for (Node *fita = v; fita != root; fita = _tlink(fita))
            if (fita->t)
                for (ll el : fita->term)
                    rs[el].push_back(i + 2);
    }

    for (ll i = 1; i <= n; ++i)
    {
        cout << (ll)rs[i].size() << " ";

        sort(rs[i].begin(), rs[i].end());
        for (ll el : rs[i])
            cout << el-sz[i] << " ";

        cout << '\n';
    }
}

int main()
{
#ifndef ONLINE_JUDGE
    //freopen("input.txt", "r", stdin);
#else
    //freopen("wizard.in", "r", stdin);
    //freopen("wizard.out", "w", stdout);
#endif
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);

    $main();

    return 0;
}

//257593BA