CF398E Sorting Permutations

We are given a permutation sequence $ a_{1},a_{2},...,a_{n} $ of numbers from $ 1 $ to $ n $ . Let's assume that in one second, we can choose some disjoint pairs $ (u_{1},v_{1}),(u_{2},v_{2}),...,(u_{k},v_{k}) $ and swap all $ a_{ui} $ and $ a_{vi} $ for every $ i $ at the same time ( $ 1

The first line contains two integers $ n $ $ (1

Print the total sum of the number of ways modulo $ 1000000007 $ $ (10^{9}+7) $ .