Cartesian product only between two sublists (level 3)

Hi, to be more clear: I’m looking for a “node-version” of the following code.

inputList;
resultList=[];

t = [Imperative]
{
    for(i in inputList)
    {
        subList=[];
        for(x in i[0])
        {
            for(y in i[1])
            {
              subList = List.AddItemToEnd([x,y], subList);
            }
        }
        resultList = List.AddItemToEnd(subList, resultList);
    }
	return = resultList;
};

(inherited from List combination, Cartesian - #13 by Vikram_Subbaiah)

With regards, Fred