I think it is basically an easy problem, but I'm stuck. My brain is blocked by this problem, so I hope you can help me. 
I have 2 to N arrays of integers, like

```
{1,2,3,4,5}
{1,2,3,4,5,6}
{1,3,5}
.....

```

Now i want to have a list containing arrays of int[N] with every posibillity like

```
{1,1,1}
{1,1,3}
{1,1,5}
{1,2,1}
....
{1,3,1}
....
{2,1,1}
{2,1,3}
....
{5,6,5}

```

so there are 6\*5\*3 (90) elements in it.

Is there a simple algorithm to do it? I think the language didn't matter but I prefer Java.