#include <iostream>
using namespace std;
const int MAX_SIZE = 100;
struct node {
    int info;
    node * prev, * next;
};

struct DoublyLinkedCircularList {
    node * head;
    node * tail;

    void init() {
        head = NULL;
        tail = NULL;
    }

    void insertFront(int x) {
        node * new_node = new node;
        new_node->info = x;
        new_node->prev = NULL;
        new_node->next = NULL;

        if(head == NULL) {
            head = new_node;
            tail = head;
            tail->next = head;
            head->prev = tail;
        }
        else {
            new_node->next = head;
            head->prev = new_node;
            head = new_node;
            tail->next = head;
            head->prev = tail;
        }
    }

    void insertBack(int x) {
        node * new_node = new node;
        new_node->info = x;
        new_node->prev = NULL;
        new_node->next = NULL;


        if(head == NULL) {
            head = new_node;
            tail = head;
            tail->next = head;
            head->prev = tail;
        }
        else {
            tail->next = new_node;
            new_node->prev = tail;
            tail = new_node;
            tail->next = head;
            head->prev = tail;
        }
    }

    void deleteFront() {
        if(head != NULL) {
            if(head->next == tail) {
                delete head;
                head = NULL;
                tail = NULL;
            }
            else {
                head = head->next;
                delete head->prev;
                head->prev = tail;
                tail->next = head;
            }
        }
    }

    void deleteBack() {
        if(head != NULL) {
            if(head->next == tail) {
                delete head;
                head =  NULL;
                tail = NULL;
            }
            else {
                tail = tail->prev;
                delete tail->next;
                tail->next = head;
                head->prev = tail;

            }
        }
    }

    void deleteAll() {
        while(head != NULL) {
            deleteBack();
        }
    }


    void deleteNode(int x) {
        if(head != NULL) {
            if(head->info == x) {
                deleteFront();
            }
            else {
                node * tmp = head;
                while(tmp->info != x) {
                    tmp = tmp->next;
                }

                if(tmp == tail) {
                    deleteBack();
                }
                else {
                    tmp->next->prev = tmp->prev;
                    tmp->prev->next = tmp->next;
                }
            }

        }
    }

    void deleteNode(node *  x) {
        if(head != NULL) {
            if(head == x) {
                deleteFront();
            }
            else {
                node * tmp = head;
                while(tmp != x) {
                    tmp = tmp->next;
                }

                if(tmp == tail) {
                    deleteBack();
                }
                else {
                    tmp->next->prev = tmp->prev;
                    tmp->prev->next = tmp->next;
                    delete tmp;
                }
            }

        }
    }
    void print() {
        node * tmp = head;
        while(tmp != tail) {
            cout << tmp->info << " <--> ";
            tmp = tmp->next;
        }
        cout << tmp->info << " <--> ";
        tmp = tmp->next;

        while(tmp != tail) {
            cout << tmp->info << " <--> ";
            tmp = tmp->next;
        }
        cout << tmp->info << endl;

        while(tmp != head) {
            cout << tmp->info << " <--> ";
            tmp = tmp->prev;
        }
        cout << tmp->info << " <--> ";
        tmp = tmp->prev;
        while(tmp != head) {
            cout << tmp->info << " <--> ";
            tmp = tmp->prev;
        }
        cout << tmp->info << endl;
    }
};

void modificiraj(DoublyLinkedCircularList & a, DoublyLinkedCircularList & b, DoublyLinkedCircularList & c) {

    node * tmp = a.head;

    while(tmp != a.tail) {
        if(tmp->info % 3 == 0) {
            c.insertBack(tmp->info);
            tmp = tmp->next;

            a.deleteNode(tmp->prev->info);
        }
        else {
            tmp = tmp->next;
        }
    }

    if(tmp->info % 3 == 0) {
        c.insertBack(tmp->info);
        a.deleteBack();
    }


    tmp = b.head;
    int pos = 0;
    while(tmp != b.tail) {
        if(pos % 2 == 0) {
            c.insertBack(tmp->info);
            tmp = tmp->next;
            b.deleteNode(tmp->prev->info);
        }
        else {
            tmp = tmp->next;
        }

        pos++;
    }

    if(tmp == b.tail && pos % 2 == 0) {
        c.insertBack(tmp->info);
        c.deleteBack();
    }

    a.print();
    cout << endl;
    b.print();
    cout << endl;
    c.print();

}
 int main() {

     DoublyLinkedCircularList a, b, c;
     a.init();
     b.init();
     c.init();

     int n, m;
     cin >> n;

     for(int i = 0; i < n; i++) {
         int x;
         cin >> x;
         a.insertBack(x);
     }
     cin >> m;
     for(int i = 0; i < m; i++) {
         int x;
         cin >> x;
         b.insertBack(x);
     }

     modificiraj(a, b, c);
    return 0;
}
/*
 8
 2 5 7 9 3 3 7 1
 12
 5 3 4 1 5 1 1 5 3 4 4 3


 **/