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 t = vec![];
    for _ in 0..n {
        let s = sc
            .read::<String>()
            .chars()
            .map(|c| c as usize - 'a' as usize)
            .collect();
        trie.add(0, &s, 0);
        t.push(s);
    }

    let mut precompute = vec![];
    for t in t.into_iter() {
        let mut dp = vec![vec![0; 26]; 26];
        let prefix = trie.count(&mut dp, 0, &t, 0);
        precompute.push((prefix, dp));
    }

    let q: usize = sc.read();
    for _ in 0..q {
        let k = sc.read::<usize>() - 1;
        let s = sc
            .read::<String>()
            .chars()
            .map(|c| c as usize - 'a' as usize)
            .collect::<Vec<_>>();
        let mut ans = precompute[k].0;
        for latter in 0..26 {
            for former in 0..latter {
                ans += precompute[k].1[s[former]][s[latter]];
            }
        }

        sc.write(ans + 1);
        sc.write("\n");
    }
}

struct Trie {
    nodes: Vec<Node>,
}

impl Trie {
    fn add(&mut self, node: usize, s: &Vec<usize>, pos: usize) {
        self.nodes[node].through += 1;

        if s.len() == pos {
            self.nodes[node].end += 1;
            return;
        }
        let next = self.nodes[node].children[s[pos]];
        if next == 0 {
            let next = self.nodes.len();
            self.nodes[node].children[s[pos]] = next;
            self.nodes.push(Node::new());
            self.add(next, s, pos + 1);
        } else {
            self.add(next, s, pos + 1);
        }
    }

    fn count(&self, dp: &mut Vec<Vec<u32>>, node: usize, s: &[usize], pos: usize) -> u32 {
        if s.len() == pos {
            return 0;
        }
        let next_c = s[pos];
        for i in 0..26 {
            let node_i = self.nodes[node].children[i];
            if node_i == 0 {
                continue;
            }
            dp[i][next_c] += self.nodes[node_i].through;
        }

        self.nodes[node].end + self.count(dp, self.nodes[node].children[s[pos]], s, pos + 1)
    }
}
struct Node {
    children: [usize; 26],
    through: u32,
    end: u32,
}

impl Node {
    fn new() -> Self {
        Self {
            children: [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: 379064