//#include<iostream>

 #include<cstring>

 #include<cstdio>

 //#include<time.h>

 //#include<complex>

 #include<set>

 //#include<queue>

 #include<algorithm>

 #include<stdlib.h>

 using namespace std;

 #define LL long long

 int qread()

 {

     char c; int s=; while ((c=getchar())<'' || c>'');

     do s=s*+c-''; while ((c=getchar())>='' && c<=''); return s;

 }

 //Pay attention to '-' , LL and double of qread!!!!

 int n,lq;

 #define maxn 200011

 struct Edge{int to,next;}edge[maxn<<]; int first[maxn],le=;

 void in(int x,int y) {Edge &e=edge[le]; e.to=y; e.next=first[x]; first[x]=le++;}

 set<int> ss[maxn]; int ls=,bel[maxn];

 struct AC

 {

     struct Node{int ch[],fail;}a[maxn];

     int num[maxn],size;

     AC() {size=; memset(a[].ch,,sizeof(a[].ch));}

     int insert(char *s,int id)

     {

         int now=,m=strlen(s);

         for (int i=;i<m;i++)

         {

             int p=s[i]-'a';

             if (!a[now].ch[p])

             {

                 int x=++size;

                 a[now].ch[p]=x;

             }

             now=a[now].ch[p];

         }

         num[id]=now;

         return now;

     }

     int que[maxn],head,tail;

     void makefail()

     {

         head=tail=;

         for (int i=;i<;i++)

         {

             int u=a[].ch[i];

             if (u) que[tail++]=u,a[u].fail=;

         }

         while (head!=tail)

         {

             int x=que[head++];

             for (int i=;i<;i++)

             {

                 int u=a[x].ch[i];

                 if (!u) {a[x].ch[i]=a[a[x].fail].ch[i]; continue;}

                 que[tail++]=u;

                 a[u].fail=a[a[x].fail].ch[i];

             }

         }

     }

     void buildtree() {for (int i=;i<=size;i++) in(a[i].fail,i);}

     void pei(char *s)

     {

         int n=strlen(s),now=;

         for (int i=;i<n;i++)

         {

             now=a[now].ch[s[i]-'a'];

             if (!bel[now]) bel[now]=++ls;

             ss[bel[now]].insert(i);

         }

     }

 }ac;

 int ques[maxn],kk[maxn],ll[maxn],ans[maxn];

 void bing(int x)

 {

     int Max=x;

     for (int i=first[x];i;i=edge[i].next)

     {

         Edge &e=edge[i];

         bing(e.to);

         if (ss[bel[e.to]].size()>ss[bel[Max]].size()) Max=e.to;

     }

     for (int i=first[x];i;i=edge[i].next)

     {

         Edge &e=edge[i]; if (e.to==Max) continue;

         for (auto j=ss[bel[e.to]].begin();j!=ss[bel[e.to]].end();j++) ss[bel[Max]].insert(*j);

     }

     if (Max!=x)

     {

         for (auto j=ss[bel[x]].begin();j!=ss[bel[x]].end();j++) ss[bel[Max]].insert(*j);

         bel[x]=bel[Max];

     }

     if (ques[x])

     {

         vector<int> p;

         for (auto j=ss[bel[x]].begin();j!=ss[bel[x]].end();j++) p.push_back(*j);

         int Ans=0x3f3f3f3f;

         for (unsigned int k=kk[ques[x]],j=k-;j<p.size();j++) Ans=min(Ans,p[j]-p[j-k+]);

         if (Ans==0x3f3f3f3f) ans[ques[x]]=-;

         else ans[ques[x]]=Ans+ll[ques[x]];

     }

 }

 char s[maxn],t[maxn];

 int main()

 {

     scanf("%s",s); n=strlen(s);

     lq=qread();

     for (int i=;i<=lq;i++)

     {

         kk[i]=qread();

         scanf("%s",t); ll[i]=strlen(t);

         ques[ac.insert(t,i)]=i;

     }

     ac.makefail();

     ac.buildtree();

     ac.pei(s);

     bing();

     for (int i=;i<=lq;i++) printf("%d\n",ans[i]);

     return ;

 }