Python Programming Lab: You are given N sets of integers A1,A2,…,AN. For each valid i, let's denote the elements of the set Ai by {ci,1,ci,2,…,ci,|Ai|}. Find the number of ways to choose a sequence...

Python Programming Lab:

You are given N sets of integers A1,A2,…,AN. For each valid i, let's denote the elements of the set Ai by {ci,1,ci,2,…,ci,|Ai|}. Find the number of ways to choose a sequence (a1,a2,…,aN) such that: ai∈Ai for each valid I ai≠ai+1 for each valid i and a1≠aN. Since this number may be large, compute it modulo 998,244,353. Write a python code to print a single line containing one integer the number of ways to choose (a1,a2,…,aN)

Input Case:

3

3 1 2 3

2 1 2

2 2 3

Output:

3