Generate Prime Number Lists

In this problem, you are given an integer ( n ) (where ( n \in \mathbb{N} ) and ( n \geq 1)), and you need to generate a list of lists where each inner list contains the first ( i ) prime numbers for ( i ) ranging from 1 to ( n ). A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself.

For example, if ( n = 5 ), the output should be:
[2]
[2, 3]
[2, 3, 5]
[2, 3, 5, 7]
[2, 3, 5, 7, 11]

Remember to format all mathematical expressions using LaTeX.

inputFormat

The input consists of a single integer ( n ) provided via standard input (stdin). ( n ) indicates the number of lists to generate, where the ( i^{th} ) list contains the first ( i ) prime numbers.

outputFormat

The output should be printed to standard output (stdout) as ( n ) lines. Each line corresponds to one inner list and must be in the format of a Python-style list. For example, if the inner list contains the numbers 2, 3, 5, it should be printed as: [2, 3, 5].## sample

1

[2]