2 2 2
16 Four sequences are evaluated: $(1, 1)$, $(1, 2)$, $(2, 1)$, and $(2, 2)$. There are $16$ ways to give each of these sequences a score between $1$ and $2$, as follows. * Give $1$ to $(1, 1)$, $1$ to $(1, 2)$, $1$ to $(2, 1)$, and $1$ to $(2, 2)$ * Give $1$ to $(1, 1)$, $1$ to $(1, 2)$, $1$ to $(2, 1)$, and $2$ to $(2, 2)$ * Give $1$ to $(1, 1)$, $1$ to $(1, 2)$, $2$ to $(2, 1)$, and $1$ to $(2, 2)$ * Give $1$ to $(1, 1)$, $1$ to $(1, 2)$, $2$ to $(2, 1)$, and $2$ to $(2, 2)$ * $\cdots$ * Give $2$ to $(1, 1)$, $2$ to $(1, 2)$, $2$ to $(2, 1)$, and $2$ to $(2, 2)$ Thus, we print $16$.
3 14 15926535
109718301 Be sure to print the count modulo $998244353$.
{
"problem": {
"name": "Integer Sequence Fair",
"description": {
"content": "Integer Sequence Exhibition is taking place, where integer sequences are gathered in one place and evaluated. Here, every integer sequence of length $N$ consisting of integers between $1$ and $K$ (inc",
"description_type": "Markdown"
},
"platform": "AtCoder",
"limit": {
"time_limit": 2000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "abc228_e"
},
"statements": [
{
"statement_type": "Markdown",
"content": "Integer Sequence Exhibition is taking place, where integer sequences are gathered in one place and evaluated. Here, every integer sequence of length $N$ consisting of integers between $1$ and $K$ (inc...",
"is_translate": false,
"language": "English"
}
]
}