By python

Suppose you have three non-empty stacks R,S, and T. Describe a sequence of operations that results in S Storing all elements originally in original elements, with both sets of those elements in their original order. The final configuration for R should be the same as its original configuration. For example, if R [1,2,3], S 4,5, and T [6,7,8,9], the final configuration should have R- 1,2, 3], S [6,7,8,9, 4,5 and T-[ T below all of S's