Problem Description

Little A has $n$ cards, numbered $1, 2, \ldots, n$. Each card has a positive integer written on it, and the positive integer on the $i$-th card is $s_i$.

Now there are $m$ rounds of games. In the $i$-th round, $c_i$ primes are given. Little A needs to choose any number of cards such that the product of the positive integers on these chosen cards is divisible by every prime given in that round.

This is not hard for Little A, so he starts thinking about a harder problem: for each round, how many different ways are there to choose cards.

Little A cannot figure it out, so he asks you for help. You only need to output the answer modulo $998244353$. Two selections $A$ and $B$ are different if and only if there exists a card that is chosen in $A$ but not in $B$, or there exists a card that is chosen in $B$ but not in $A$. Note: two cards with the same number written on them but different indices are considered different cards.

Input Format

The first line contains a positive integer $n$, indicating the number of cards.

The second line contains $n$ positive integers $s_i$, indicating the number written on each card.

The third line contains a positive integer $m$, indicating the number of rounds.

The next $m$ lines describe the rounds. In each line, the first positive integer is $c_i$, indicating the number of primes given in that round, followed by $c_i$ primes $p_{i, j}$, indicating all primes given in that round. The testdata guarantees that $\sum_i c_i \le 18000$, i.e., the sum of all $c_i$ does not exceed $18000$.

Output Format

Output $m$ lines. Each line contains one integer. The $i$-th line is the number of valid selections for the $i$-th round modulo $998244353$.

5
10 2 10 5 46
4
2 2 5
2 2 23
1 3
1 23

27
16
0
16

见附件中的 card/card2.in

见附件中的 card/card2.ans

Hint

[Sample Explanation #1]

Round 1: Except for the following $5$ selections, all other selections are valid: selecting nothing, selecting $2$, selecting $5$, selecting $46$, selecting $2$ and $46$. Therefore, the answer is $2^5 - 5 = 27$.

Round 2: As long as $46$ is selected, it does not matter whether other cards are selected, so the answer is $2^4 = 16$.

[Constraints]

For $100 \%$ of the testdata, $1 \le n \le {10}^6$, $1 \le s_i \le 2000$, $1 \le m \le 1500$, $1 \le c_i, \sum_i c_i \le 18000$, $2 \le p_{i, j} \le 2000$.

Translated by ChatGPT 5