Rabin-Karp giving wrong answer with increasing power raise to p

Question

I have started learning string processing algorithms and wanted to implement the Rabin-Karp algorithm in C++. I have taken:

p = prime number larger than character set