这样为什么全wa啊，有hack数据嘛

using ull = unsigned long long;

const ull p = 1e9 + 7;
const ull mod = 1e9 + 13;
inline ull hashs(string& s)
{
    ull res = 0;
    for(auto x : s) res = (res * p + x) % mod;
    return res;
}

void solve()
{
    int n; cin >> n; set<ull> s[n];
    for(int i = 1; i <= n; i++)
    {
        int m; cin >> m; string ss;
        while(m--) {cin >> ss; s[i - 1].insert(hashs(ss));}
    }
    int q; cin >> q;
    while(q--)
    {
        string ss; cin >> ss; ull t = hashs(ss);
        for(int i = 0; i < n; i++) 
        {
            auto it = s[i].lower_bound(t);
            if(it != s[i].end() and *it == t) cout << i + 1 << ' ';
        }
        cout << endl;
    }
}