Problem:
Score : 1100 points

Problem Statement

There are N strings of lowercase alphabet only. The i-th string is S_i. Every string is unique.

Provide answers for the Q queries below. The i-th query has the following format:

Query: An integer k_i and a string p_{i,1}p_{i,2}...p_{i,26} that results from permuting {a,b,...,z} are given. Output the sequence of the string S_{k_i} among the N strings in lexicographical order when the literal sequence is p_{i,1}<p_{i,2}<...<p_{i,26}.

Constraints

1 ≦ N,Q ≦ 100000

1 ≦ |S_i| (1 ≦ i ≦ N)

S_i (1 ≦ i ≦ N) is a string of lowercase alphabet.

The sum of |S_i| is no more than 400000.

Every S_i is unique.

1 ≦ k_i ≦ N (1 ≦ i ≦ Q)

For all 1 ≦ i ≦ Q, p_{i,1}p_{i,2}...p_{i,26} is a permutation of abcd...z.

Input

Inputs are provided from standard inputs in the following form.

N
S_1
:
S_N
Q
k_1 p_{1,1}p_{1,2}...p_{1,26}
:
k_Q p_{Q,1}p_{Q,2}...p_{Q,26}

Output

Output Q lines.

On line i, for the i-th query, output an integer indicating the sequence of the string S_{k_i} among the N strings in lexicographical order.

Sample Input 1

5
aa
abbaa
abbba
aaab
aaaaaba
5
1 abcdefghijklmnopqrstuvwxyz
2 bacdefghijklmnopqrstuvwxyz
3 abcdefghijklmnopqrstuvwxyz
4 bacdefghijklmnopqrstuvwxyz
5 abcdefghijklmnopqrstuvwxyz

Sample Output 1

1
2
5
4
2

When the literal sequence is a < b, sorting the input strings in lexicographical order yields aa, aaaaaba, aaab, abbaa, abbba. The answers to queries 1, 3, and 5 are thus 1, 5, and 2, respectively.

When the literal sequence is b < a, sorting the input strings in lexicographical order yields abbba, abbaa, aa, aaab, aaaaaba. The answers to queries 2 and 4 are thus 2 and 4, respectively.

Sample Input 2

8
abrakatabra
abadaba
abracadabra
atcoder
grand
contest
ababa
a
6
3 abcdefghijklmnopqrstuvwxyz
6 qwertyuiopasdfghjklzxcvbnm
8 poiuytrewqlkjhgfdsamnbvcxz
2 qazwsxedcrfvtgbyhnujmikolp
1 plokmijnuhbygvtfcrdxeszwaq
4 mnbvcxzasdfghjklpoiuytrewq

Sample Output 2

4
8
2
3
4
7

Solution in Rust (1.42.0) (judge verdict: Memory Limit Exceeded)

fn main() {
    let (r, w) = (std::io::stdin(), std::io::stdout());
    let mut sc = IO::new(r.lock(), w.lock());
    let n: usize = sc.read();

    let mut trie = Trie {
        nodes: vec![Node::new()],
    };
    let mut s = vec![];
    for _ in 0..n {
        let t = sc
            .read::<String>()
            .chars()
            .map(|c| c as usize - 'a' as usize)
            .collect::<Vec<_>>();
        trie.insert(0, &t, 0);
        s.push(t);
    }

    let mut prefix_count = vec![0; n];
    let mut count = vec![];
    for i in 0..n {
        let mut sum = [[0; 26]; 26];
        trie.count(0, &s[i], 0, &mut sum);
        count.push(sum);
        prefix_count[i] = trie.prefix_count(0, &s[i], 0);
    }

    let q: usize = sc.read();
    for _ in 0..q {
        let k = sc.read::<usize>() - 1;
        let p = sc
            .read::<String>()
            .chars()
            .map(|c| c as usize - 'a' as usize)
            .collect::<Vec<_>>();

        let mut ans = 0;
        for tail in 0..26 {
            for head in 0..tail {
                let head = p[head];
                let tail = p[tail];
                ans += count[k][head][tail];
            }
        }
        ans += prefix_count[k];
        sc.write(ans + 1);
        sc.write("\n");
    }
}

struct Trie {
    nodes: Vec<Node>,
}

impl Trie {
    fn prefix_count(&self, node: usize, s: &[usize], pos: usize) -> usize {
        if pos == s.len() {
            return 0;
        }

        let next_c = s[pos];
        let next_node = self.nodes[node].next[next_c];
        self.prefix_count(next_node, s, pos + 1) + self.nodes[node].end
    }
    fn count(&self, node: usize, s: &[usize], pos: usize, sum: &mut [[usize; 26]; 26]) {
        if pos == s.len() {
            return;
        }

        let next_c = s[pos];
        let next_node = self.nodes[node].next[next_c];
        assert_ne!(next_node, 0);
        for c in 0..26 {
            if c == next_c {
                continue;
            }
            let c_node = self.nodes[node].next[c];
            if c_node == 0 {
                continue;
            }
            sum[c][next_c] += self.nodes[c_node].through;
        }
        self.count(next_node, s, pos + 1, sum);
    }

    fn insert(&mut self, node_id: usize, s: &[usize], pos: usize) {
        self.nodes[node_id].through += 1;
        if s.len() == pos {
            self.nodes[node_id].end += 1;
            return;
        }

        let c = s[pos];
        let next = self.nodes[node_id].next[c];
        if next == 0 {
            let next = self.nodes.len();
            self.nodes[node_id].next[c] = next;
            self.nodes.push(Node::new());
            self.insert(next, s, pos + 1);
        } else {
            self.insert(next, s, pos + 1);
        }
    }
}

struct Node {
    next: [usize; 26],
    through: usize,
    end: usize,
}

impl Node {
    fn new() -> Self {
        Self {
            next: [0; 26],
            through: 0,
            end: 0,
        }
    }
}

pub struct IO<R, W: std::io::Write>(R, std::io::BufWriter<W>);

impl<R: std::io::Read, W: std::io::Write> IO<R, W> {
    pub fn new(r: R, w: W) -> Self {
        Self(r, std::io::BufWriter::new(w))
    }
    pub fn write<S: ToString>(&mut self, s: S) {
        use std::io::Write;
        self.1.write(s.to_string().as_bytes()).unwrap();
    }
    pub fn read<T: std::str::FromStr>(&mut self) -> T {
        use std::io::Read;
        let buf = self
            .0
            .by_ref()
            .bytes()
            .map(|b| b.unwrap())
            .skip_while(|&b| b == b' ' || b == b'\n' || b == b'\r' || b == b'\t')
            .take_while(|&b| b != b' ' && b != b'\n' && b != b'\r' && b != b'\t')
            .collect::<Vec<_>>();
        unsafe { std::str::from_utf8_unchecked(&buf) }
            .parse()
            .ok()
            .expect("Parse error.")
    }
    pub fn vec<T: std::str::FromStr>(&mut self, n: usize) -> Vec<T> {
        (0..n).map(|_| self.read()).collect()
    }
    pub fn chars(&mut self) -> Vec<char> {
        self.read::<String>().chars().collect()
    }
}