F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Permanent

Time Limit: 14000/7000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 191    Accepted Submission(s): 46


Problem Description
Teacher Mai has solved the #P complete in polynomial time recently.

So he gives this task to you. You are given a matrix of n rows and n columns, you should calculate the permanent of this.

But this matrix is special, nearly all the elements are 1. Only the cells on the main diagonal are modified.

You are given n integers ai. You should calculate permanents of m matrices. The size of i-th matrix is n+i-1.

In i-th matrix,


The number can be very large, just output the number modulo 998244353.

If you don't know what is the permanent of a matrix, please click http://en.wikipedia.org/wiki/Permanent or http://baike.baidu.com/view/8212164.htm
 

Input
There are multiple test cases, terminated by a line "0 0".

For each test case, the first line contains two integers n,m(1<=n,m<=10^5).

The following one line contains n integers ai,(0<=ai<=10^6).
 

Output
For each test case, first output one line "Case #k:", where k is the case number counting from 1.

The following k lines contains a integer, indicating the permanent of the i-th matrix.
 

Sample Input
3 2 2 3 3 0 0
 

Sample Output
Case #1: 28 46
 

Author
xudyh
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-11-21 18:31:49, Gzip enabled