Help with selection

This time Rahul has been given a simple problem. He has to find the number of ways of selecting K distinct items from a group of N distinct items. As the output can be large print the answer modulo P. Flawed code #include #define ll long long ll fact[1000000]; int pwr(int x,int p,int mod){ ll t = 1,a=x; while(p){a=(a*a)%mod;p=p>>1;} return t;} ll abc(int n,int r,int MOD){ ll tem=(fac