// Giải thuật ac cho bài toán ac-pattern\n#include <bits/stdc++.h>
using namespace std;

const int ALPHABET = 26;

struct AhoCorasick {
    struct Node {
        int next[ALPHABET];
        int fail, dict;
        vector<int> out;
        Node() {
            fill(next, next + ALPHABET, -1);
            fail = dict = -1;
        }
    };
    vector<Node> trie;
    AhoCorasick() { trie.emplace_back(); }
    void insert(const string& s, int id) {
        int node = 0;
        for (char ch : s) {
            int c = ch - 'a';
            if (trie[node].next[c] == -1) {
                trie[node].next[c] = trie.size();
                trie.emplace_back();
            }
            node = trie[node].next[c];
        }
        trie[node].out.push_back(id);
    }
    void build() {
        queue<int> q;
        for (int c = 0; c < ALPHABET; c++) {
            if (trie[0].next[c] != -1) {
                trie[trie[0].next[c]].fail = 0;
                q.push(trie[0].next[c]);
            } else {
                trie[0].next[c] = 0;
            }
        }
        while (!q.empty()) {
            int u = q.front(); q.pop();
            if (trie[trie[u].fail].out.size())
                trie[u].dict = trie[u].fail;
            else
                trie[u].dict = trie[trie[u].fail].dict;
            for (int c = 0; c < ALPHABET; c++) {
                if (trie[u].next[c] != -1) {
                    trie[trie[u].next[c]].fail = trie[trie[u].fail].next[c];
                    q.push(trie[u].next[c]);
                } else {
                    trie[u].next[c] = trie[trie[u].fail].next[c];
                }
            }
        }
    }
};

int main() {
    // Doc du lieu dau vao
    ios::sync_with_stdio(false); cin.tie(0);
    string t; cin >> t;
    int k; cin >> k;
    vector<string> pat(k);
    AhoCorasick aho;
    for (int i = 0; i < k; i++) {
        cin >> pat[i];
        aho.insert(pat[i], i);
    }
    aho.build();
    vector<vector<int>> pos(k);
    int node = 0;
    for (int i = 0; i < (int)t.size(); i++) {
        int c = t[i] - 'a';
        node = aho.trie[node].next[c];
        for (int id : aho.trie[node].out)
            pos[id].push_back(i - (int)pat[id].size() + 1);
        int temp = aho.trie[node].dict;
        while (temp != -1) {
            for (int id : aho.trie[temp].out)
                pos[id].push_back(i - (int)pat[id].size() + 1);
            temp = aho.trie[temp].dict;
        }
    }
    for (int i = 0; i < k; i++) {
        if (pos[i].empty()) continue;
        cout << i << " " << pos[i].size();
        for (int p : pos[i]) cout << " " << p;
        cout << "\n";
    }
    return 0;
}