CF582D Number of Binominal Coefficients

For a given prime integer $ p $ and integers $ α,A $ calculate the number of pairs of integers $ (n,k) $ , such that $ 0

The first line contains two integers, $ p $ and $ α $ ( $ 1

In the single line print the answer to the problem.

In the first sample three binominal coefficients divisible by 4 are ,  and .