{"problem":{"name":"Increasing K Times","description":{"content":"You are given an integer sequence $A = (A_1, \\dots, A_N)$ of length $N$. Find the number, modulo $998244353$, of permutations $P = (P_1, \\dots, P_N)$ of $(1, 2, \\dots, N)$ such that: *   there exist ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc267_g"},"statements":[{"statement_type":"Markdown","content":"You are given an integer sequence $A = (A_1, \\dots, A_N)$ of length $N$.\nFind the number, modulo $998244353$, of permutations $P = (P_1, \\dots, P_N)$ of $(1, 2, \\dots, N)$ such that:\n\n*   there exist exactly $K$ integers $i$ between $1$ and $(N-1)$ (inclusive) such that $A_{P_i} \\lt A_{P_{i + 1}}$.\n\n## Constraints\n\n*   $2 \\leq N \\leq 5000$\n*   $0 \\leq K \\leq N - 1$\n*   $1 \\leq A_i \\leq N \\, (1 \\leq i \\leq N)$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $K$\n$A_1$ $\\ldots$ $A_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc267_g","tags":[],"sample_group":[["4 2\n1 1 2 2","4\n\nFour permutations satisfy the condition: $P = (1, 3, 2, 4), (1, 4, 2, 3), (2, 3, 1, 4), (2, 4, 1, 3)$."],["10 3\n3 1 4 1 5 9 2 6 5 3","697112"]],"created_at":"2026-03-03 11:01:14"}}