Search It !

You are given a matrix $A$ of $N$ x $N$ dimensions whose each entry $A$ij is a capital letter English alphabet and a string $S$ of length $M$. Your task is to search whether there exist a continuous path which matches the given string in matrix from any $(i, j)$ but the only condition is that you can move to cell $(i+1, j)$, $(i, j+1)$ or $(i+1, j+1)$ from every cell $(i, j)$ on which you currentl