class SuffixTreeNode {

public:

    unordered_map<char, SuffixTreeNode*> children;

    char value;

    vector<int> indexes;

    void insertString(string s, int idx) {

        indexes.push_back(idx);

        if (!s.empty()) {

            value = s[];

            SuffixTreeNode *child;

            if (children.count(value)) {

                child = children[value];

            } else {

                child = new SuffixTreeNode();

                children[value] = child;

            }

            string remainder = s.substr();

            child->insertString(remainder, idx);

        }

    }

    vector<int> search(string s) {

        if (s.empty()) return indexes;

        char first = s[];

        if (children.count(first)) {

            string remainder = s.substr();

            return children[first]->search(remainder);

        }

        return {};

    }

};

class SuffixTree {

public:

    SuffixTreeNode *root = new SuffixTreeNode();

    SuffixTree(string s) {

        for (int i = ; i < s.size(); ++i) {

            string suffix = s.substr(i);

            root->insertString(suffix, i);

        }

    }

    vector<int> search(string s) {

        return root->search(s);

    }

};