Schreier tree

Suppose G is generated by a set of permutations. If x and y are two elements in a G-orbit, then, using a Schreier tree, one can find an element g in G with g(x) = y.

Enter the generators for G and enter x and y as root and goal, respectively.