at the moment the orientation is capped by the lowest number of inputs:

Shortest list component in yellow means that all the A B C input list will be equally trimmed to the length of the shortest one among them (in the saved file the shortest list among ABC is the list of breps and initial planes [A and B], 64 items, so whatever number of destination planes is provided, it will just be trimmed to the first 64 items)

in general in GH if you want to do operations with lists of different lengths, GH will duplicate the very last item of the shorter lists until the length of the longest one is reached

if we remove the shortest list component and plug everything directly to Orient:

first thing we notice: it works

but

because we provide only 64 breps (and their reference plane) and 322 destination planes, then the very last brep and its reference plane (both at index 63) are used for all the destination planes at index 63 up to 321, which I think it’s not what you want

you can use repeat data in such a way to repeat the whole list of all the 64 breps and 64 initial planes to the final length of the destination planes

repeat data just repeats the whole list again and again until the desired length L is reached

this way, because data is repeated 322/64=5.03something it means you will have most initial breps repeated and oriented 5 times, and a few of them (the ones at the beginning of the brep list) repeated and oriented 6 times, all of those on a different destination plane

regarding their rotation: at the moment the only possible rotation is on the plane XY

first it’s generated a list of the 4 possible rotations {0, Pi/2, Pi and 3/2*Pi} then the list is duplicated to the very same length of the destination planes, then it’s mixed randomly using the seed value

this means that the each of the 4 possible rotations will always be present at 25% (or close to that value if the total length is not a multiple of 4)

you can get a rotation that is “more random” with something like this

rearrange_objects_new_Re_Re.gh (32.5 KB)