recursive function 2

[kurousagi]

Lets say that I have a vector of vector of integers. <1,2,3,4> , <5,6,7,8>, <10,11,12,13>

how do I make a function that creates vector of vector of every different integers?

<1,5,10> , <1,5,11>, <1,5,12>, <1,5,13>
<1,6,10> , <1,6,11>, <1,6,12>, <1,6,13>
<1,7,10> , <1,7,11>, <1,7,12>, <1,7,13>
<1,8,10>, <1,8,11>, <1,8,12>, <1,8, 13>
<2,5,10>, <2,5,11>, <2,5,12>, <2,5,13>
and so on...

[IndieExe]

I don't completely understand.
Do you want to make a new vector for each non-identic to any previous integers?

[kurousagi]

I would like to make vector of vector of integers of every pattern possible.
so if I continue it would be
<2,6,10>, <2,6,11>,<2,6,12>,<2,6,13> .................... <4,8,11><4,8,12><4,8,13>..

and the function should be able to take in any number of vector of vector of integers.