P7592 - Product

内存限制：524 MB 时间限制：5 S

题面：传统评测方式：文本比较上传者：

提交：0 通过：0

提交提交记录统计 Web Board

You are given a prime

p . For a number

a , you need to find positive integers

x1,x2,…,xk such that

∏xi≡a(modp) , and

∑xi≤2500 . Output any valid solution.

The first line contains a prime

p(1≤p≤1018) ,

p is chosen uniformly and randomly from

[0.9×1018,1018] .

The second line contains a integer

q(1≤q≤100) . Each line of the following

q lines contains an integer

a(1≤a≤p−1) ,

a is chosen from

[1,p−1] uniformly and randomly.

Output

q lines for each number. In each line, prine

k first, then

x1,x2,…,xk .

2 2 3
1 100
2 1000 1000

7592: Product