{"problem":{"name":"Child to Parent","description":{"content":"There is a rooted tree with $N$ vertices numbered $1$ to $N$. Vertex $1$ is the root, and the parent of vertex $i$ ($2\\leq i\\leq N$) is $P_i$. You are given a non-negative integer $r$ and a sequence o","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":4000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"agc063_e"},"statements":[{"statement_type":"Markdown","content":"There is a rooted tree with $N$ vertices numbered $1$ to $N$. Vertex $1$ is the root, and the parent of vertex $i$ ($2\\leq i\\leq N$) is $P_i$.\nYou are given a non-negative integer $r$ and a sequence of non-negative integers $A = (A_1, \\ldots, A_N)$. You can perform the following operation on the sequence any number of times, possibly zero.\n\n*   Choose an $i$ such that $i\\geq 2$ and $A_i \\geq 1$. Replace $A_i$ with $A_i - 1$ and $A_{P_i}$ with $A_{P_i}+r$.\n\nFind the number, modulo $998244353$, of possible final states of the sequence $A$.\n\n## Constraints\n\n*   $2\\leq N\\leq 300$\n*   $1\\leq P_i \\leq i - 1$ ($2\\leq i\\leq N$)\n*   $0\\leq r \\leq 10^9$\n*   $0\\leq A_i \\leq 10^9$\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$N$\n$P_2$ $\\ldots$ $P_N$\n$r$\n$A_1$ $\\ldots$ $A_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"agc063_e","tags":[],"sample_group":[["3\n1 1\n2\n1 1 1","4\n\nThe four possible final states of $A$ are $(1,1,1)$, $(3,0,1)$, $(3,1,0)$, and $(5,0,0)$."],["3\n1 2\n1\n1 1 1","5\n\nThe five possible final states of $A$ are $(1,1,1)$, $(1,2,0)$, $(2,0,1)$, $(2,1,0)$, and $(3,0,0)$."],["3\n1 2\n2\n1 1 1","6\n\nThe six possible final states of $A$ are $(1,1,1)$, $(1,3,0)$, $(3,0,1)$, $(3,2,0)$, $(5,1,0)$, and $(7,0,0)$."],["5\n1 1 3 3\n2\n0 1 0 1 2","48"],["5\n1 1 3 3\n123456789\n1 2 3 4 5","87782255"]],"created_at":"2026-03-03 11:01:14"}}