#agc036f. [agc036_f]Square Constraints

[agc036_f]Square Constraints

给你一个整数NN,求有多少0,1,2...2N10,1,2...2N-12N2N个数)的排列PP,满足:

对于任意i(0<=i<=2N1)i(0<=i<=2N-1),有N2<=i2+Pi2<=(2N)2N^2<=i^2+P_{i}^2<=(2N)^2

输出答案对MM取模的结果(MM是输入的)