#include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define LC(ql) (ql<<1)
#define RC(ql) ((ql<<1)+1)
#define MID(ql,qr) ((ql+qr)>>1)
#define fin(name) freopen(name,"r",stdin)
#define fout(name) freopen(name,"w",stdout)
#define CLR(arr,val) memset(arr,val,sizeof(arr))
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);
typedef pair<int, int> pii;
typedef long long LL;
const double PI = acos(-1.0);
const int N = 100010;
struct Trie
{
    int nxt[26];
    int id;
    void reset()
    {
        fill(nxt, nxt + 26, 0);
        id = 0;
    }
};
struct seg
{
    int lson, rson;
    int cnt;
    void reset()
    {
        lson = rson = 0;
        cnt = 0;
    }
};
Trie L[N];
seg T[N * 36];
int sz, tot, tid, arr[N], Tot;
int lenth[N], last[N], root[N];
char s[N];

void init()
{
    sz = 1;
    tot = 0;
    tid = 0;
    Tot = 0;
    CLR(last, 0);
    L[0].reset();
}
void update(int &cur, int ori, int l, int r, int pos, int flag)
{
    cur = ++tot;
    T[cur] = T[ori];
    T[cur].cnt += flag;
    if (l == r)
        return ;
    int mid = MID(l, r);
    if (pos <= mid)
        update(T[cur].lson, T[ori].lson, l, mid, pos, flag);
    else
        update(T[cur].rson, T[ori].rson, mid + 1, r, pos, flag);
}
int query(int S, int E, int l, int r, int ql, int qr)
{
    if (ql <= l && r <= qr)
        return T[E].cnt - T[S].cnt;
    else
    {
        int ret = 0;
        int mid = MID(l, r);
        if (ql <= mid)
            ret += query(T[S].lson, T[E].lson, l, mid, ql, qr);
        if (qr > mid)
            ret += query(T[S].rson, T[E].rson, mid + 1, r, ql, qr);
        return ret;
    }
}
int insert(int id, char s[])
{
    int len = strlen(s);
    int u = 0;
    for (int i = 0; i < len; ++i)
    {
        int v = s[i] - ‘a‘;
        if (!L[u].nxt[v])
        {
            L[sz].reset();
            L[u].nxt[v] = sz++;
        }
        u = L[u].nxt[v];
        if (L[u].id == 0)
            L[u].id = ++tid;
        arr[++Tot] = L[u].id;
    }
    lenth[id] = Tot;
    return len;
}
int main(void)
{
    int n, m, i, l, r;
    while (~scanf("%d%d", &n, &m))
    {
        init();
        for (i = 0; i < n; ++i)
        {
            scanf("%s", s);
            insert(i, s);
        }
        for (i = 1; i <= Tot; ++i)
        {
            if (!last[arr[i]])
                update(root[i], root[i - 1], 1, Tot, i, 1);
            else
            {
                int tmp;
                update(tmp, root[i - 1], 1, Tot, last[arr[i]], -1);
                update(root[i], tmp, 1, Tot, i, 1);
            }
            last[arr[i]] = i;
        }
        scanf("%d", &m);
        int ans = 0;
        while (m--)
        {
            int L, R;
            scanf("%d%d", &L, &R);
            l = min((L + ans) % n, (R + ans) % n);
            r = max((L + ans) % n, (R + ans) % n);
            L = l - 1 >= 0 ? lenth[l - 1] : 0;
            R = lenth[r];
            printf("%d\n", ans = query(root[L], root[R], 1, Tot, L + 1, R));
        }
    }
    return 0;
}