Task: Implement a Queue Using Three Stacks with O(1) Amortized Operations

Task: Implement a Queue Using Three Stacks with O(1) Amortized Operations: a task in Terminal-Lego-15k (Harbor dataset). Implement a queue data structure using exactly three stacks such that each queue operation ( enqueue and dequeue ) takes a constant (amortized) number of stack operations.