Algorithm to represent a serie of number

Algorithm to represent a serie of number

It's simple: I have a serie of numbers and I want to put write that using
a algorithm (iterative or recursive, doesn't matter... but the best answer
could be iterative).
Contextualizing: This numbers are indexes to iterative over a list of
lists. I need to do a permutation (combination, comutation, i don't know
exactly), but I need to generate all combinations of all positions of that
list of lists.
The serie is:
1 1
2 1
3 1
4 1
5 1
1 2
2 1
3 1
4 1
5 1
1 3
2 1
3 1
4 1
5 1
1 4
2 1
3 1
4 1
5 1
1 5
2 1
3 1
4 1
5 1
1 1
2 2
3 1
4 1
5 1
1 2
2 2
3 1
4 1
5 1
1 3
2 2
3 1
4 1
5 1
1 4
2 2
3 1
4 1
5 1
1 5
2 2
3 1
4 1
5 1
1 1
2 3
3 1
4 1
5 1
1 2
2 3
3 1
4 1
5 1
1 3
2 3
3 1
4 1
5 1
1 4
2 3
3 1
4 1
5 1
1 5
2 3
3 1
4 1
5 1
1 1
2 4
3 1
4 1
5 1
and so on... the last state is:
1 5
2 5
3 5
4 5
5 5
Note that at each line break is a step of iteration or recursion.
I hope that you can help me ! (: