Mex-P Tree (Easy)

**This is the easy version of the problem Mex-P Tree. The only difference between this version and the hard version is the constraint on $N$: in this version, $N$ and the sum of $N$ across all tests won't exceed $2000$.** The $\text{MEX-P}$ of a non-empty set $S$ of positive integers is defined to be the smallest **prime** number that doesn't divide at least one element of $S$. For example, $\te