Submit solution

Points:
25 (partial)

Time limit:
0.6s

Memory limit:
64M

Author:

Problem type

Allowed languages

Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, ~~CommonLisp~~, D, Dart, F#, Forth, Fortran, Go, ~~Groovy~~, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, ~~Nim~~, ~~ObjC~~, OCaml, ~~Octave~~, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

d is not in a good mood today, so he has decided to torment people. He wants you to write a large factorial calculator. More specifically, he wants you to calculate very *very* **very** large factorials. He wishes you luck.

#### Input Specification

The first line of input contains the integer , , the number of cases to follow.

The next lines will contain an integer , such that , whose factorial you are to calculate.

#### Output Specification

For every integer , you are to output .

#### Sample Input

```
2
5
13
```

#### Sample Output

```
120
1932053509
```

## Comments

This comment is hidden due to too much negative feedback. Click here to view it.

No

Good job d, you just turned a comment into a problem ;)

This comment is hidden due to too much negative feedback. Click here to view it.

For every integer , you are to output (mod )