I have been exploring the idea of Computing Binomial Coefficients $$$\binom{n}{k} \mod m$$$ where n,k ans MOD are all 64 bit integers.ie $$$m$$$ is any integer rather than being a prime. I have found few solutions here where they first factorise adn proceed for each $$$p^k$$$. However almost none of them scale for large 64 bit mod. Just changing the data type wont fix as it overshoots memory. How do I modify them to scale to 64 bit for each of $$$n,k,m$$$