magazin

#include<bits/stdc++.h>
using namespace std;

int main()
{
    string s;
    vector<vector<int>> v(26);
    int n;
    ifstream f("magazin.in");
    f>>n>>s;
    for(int i=0;i<(int)s.size();++i)
        v[s[i]-'a'].push_back(i);
    f>>n;
    ofstream g("magazin.out");
    for(int i=0;i<n;++i)
    {
        f>>s;
        int Max=0;
        unordered_map<int,int> q;
        for(int j=0;j<(int)s.size();++j)
            ++q[s[j]-'a'];
        for(auto it:q)
            Max=max(Max,v[it.first][it.second-1]);
        g<<Max+1<<'\n';
    }
}