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) -> u32 {
        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 [[u32; 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: u32,
    end: u32,
}

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()
    }
}


Measured memory_bytes: 298592