{"raw_statement":[{"iden":"problem statement","content":"There are $N$ chairs arranged in a row, called Chair $1$, Chair $2$, $\\ldots$, Chair $N$.  \nA chair seats only one person.\n$M$ people will sit on $M$ of these chairs. Here, let us define the score as follows:\n\n> $\\displaystyle \\prod_{i=1}^{M-1} (B_{i+1} - B_i)$, where $B=(B_1,B_2,\\ldots,B_M)$ is the sorted list of the indices of the chairs the people sit on.\n\nPerson $i$ $(1 \\leq i \\leq K)$ is already sitting on Chair $A_i$.  \nThere are ${} _ {N-K} \\mathrm{P} _ {M-K}$ ways for the other $M-K$ people to take seats. Find the sum of the scores for all of these ways.\nSince this sum may be enormous, compute it modulo $998244353$."},{"iden":"constraints","content":"*   $2 \\leq N \\leq 2 \\times 10^5$\n*   $2 \\leq M \\leq N$\n*   $0 \\leq K \\leq M$\n*   $1 \\leq A_1 \\lt A_2 \\lt \\ldots \\lt A_K \\leq N$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $M$ $K$\n$A_1$ $A_2$ $\\ldots$ $A_K$"},{"iden":"sample input 1","content":"5 3 2\n1 3"},{"iden":"sample output 1","content":"7\n\nIf Person $3$ sits on Chair $2$, the score will be $(2-1) \\times (3-2)=1 \\times 1 = 1$.  \nIf Person $3$ sits on Chair $4$, the score will be $(3-1) \\times (4-3)=2 \\times 1 = 2$.  \nIf Person $3$ sits on Chair $5$, the score will be $(3-1) \\times (5-3)=2 \\times 2 = 4$.  \nThe answer is $1+2+4=7$."},{"iden":"sample input 2","content":"6 6 1\n4"},{"iden":"sample output 2","content":"120\n\nThe score for every way of sitting will be $1$.  \nThere are ${} _ {5} \\mathrm{P} _ {5} = 120$ ways of sitting, so the answer is $120$."},{"iden":"sample input 3","content":"99 10 3\n10 50 90"},{"iden":"sample output 3","content":"761621047"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}