{"raw_statement":[{"iden":"problem statement","content":"Snuke loves permutations. He is making a permutation of length $N$.\nSince he hates the integer $K$, his permutation will satisfy the following:\n\n*   Let the permutation be $a_1, a_2, ..., a_N$. For each $i = 1,2,...,N$, $|a_i - i| \\neq K$.\n\nAmong the $N!$ permutations of length $N$, how many satisfies this condition?\nSince the answer may be extremely large, find the answer modulo $924844033$(prime)."},{"iden":"constraints","content":"*   $2 ≦ N ≦ 2000$\n*   $1 ≦ K ≦ N-1$"},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$ $K$"},{"iden":"sample input 1","content":"3 1"},{"iden":"sample output 1","content":"2\n\n$2$ permutations $(1, 2, 3)$, $(3, 2, 1)$ satisfy the condition."},{"iden":"sample input 2","content":"4 1"},{"iden":"sample output 2","content":"5\n\n$5$ permutations $(1, 2, 3, 4)$, $(1, 4, 3, 2)$, $(3, 2, 1, 4)$, $(3, 4, 1, 2)$, $(4, 2, 3, 1)$ satisfy the condition."},{"iden":"sample input 3","content":"4 2"},{"iden":"sample output 3","content":"9"},{"iden":"sample input 4","content":"4 3"},{"iden":"sample output 4","content":"14"},{"iden":"sample input 5","content":"425 48"},{"iden":"sample output 5","content":"756765083"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}