Not Adjacent

$2N$ distinct, labelled points are located on a circle of arbitrary radius. We need to connect $K$ pairs of points under the following restrictions: - No two neighbouring points must be connected. - Each point must be connected to at most $1$ other point. Count the number of ways to make $K$ connections. Since the answer can be huge, print it modulo $998244353$. ### Input - First line will cont