Creating a 'for' loop for a naive/brute force approach (finding all paths) that repeats and doesn't require hardcoding of the array size

Question

My task is to use a naive/brute force approach to find all the possible paths within a mxn array (for example a 10x10), going from the first row to the bottom row. From any