Loop through all combinations of arrays of strings?

Question

Algorithms

As input, the program can receive a different number of arrays, the number of which is not known before the program is executed. And all variations of strings from these arrays must be used.
If the data were static, I would write nested arrays, but without them I don’t understand what to do, but I can’t figure out how to make it recursive.

Answer 1

The recursive function must take the current set of rows and the number of the next array. The function loops through a string from the next array, adds that string to the current set, and is called recursively. After the call, the last line must be removed from the current set. If at the beginning of the function you see that all arrays have already been processed, output the current set as a response and return from the function.
Also, of course, you need to pass an array of arrays of strings to the function - your initial data.