assume that k,n are two positive integer $k\leq n$count the number of permutation $\{\ 1,\dots ,n\}\ $ st for any $1\leq i,j\leq k$and any positive integer m we have $f^m(i)\neq j$ ($f^m$ meas iterarte function,)