Neater way of making indexes?

[Jane Austine]

The function returns a list of ordered indexes for nested for-loops of
given input ranges.

>>> from itertools import *
>>> def indexes(upto):
    multi=lambda alist:reduce(lambda x,y:x*y,alist,1)
    g=[ cycle(chain(*[repeat(each,multi(upto[i+1:])) for each in
range(upto[i])]))
        for i in range(len(upto))]
    return list(islice(izip(*g),multi(upto)))

>>> indexes((4,))
[(0,), (1,), (2,), (3,)]
>>> indexes((3,2,4))
[(0, 0, 0), (0, 0, 1), (0, 0, 2), (0, 0, 3), (0, 1, 0), (0, 1, 1), (0,
1, 2), (0, 1, 3), (1, 0, 0), (1, 0, 1), (1, 0, 2), (1, 0, 3), (1, 1,
0), (1, 1, 1), (1, 1, 2), (1, 1, 3), (2, 0, 0), (2, 0, 1), (2, 0, 2),
(2, 0, 3), (2, 1, 0), (2, 1, 1), (2, 1, 2), (2, 1, 3)]

I don't like this code too much. Any suggestions?

Jane.