Search a word in a matrix runtime comlexity

Question

Trying to analyze the runtime complexity of the following algorithm:

Problem: We have an m * n array A consisting of lower case letters and