#include <stdlib.h>
#include <stdio.h>
#include <iostream>
#include <iomanip>

using namespace std;

class Stack
{
    private:
        int size, size_now, top;
        int *arr = new int[0];
        int *arr_del_last();
    public:
        Stack (int _size);
        ~Stack();
        void add (int elem);
        int del_last();
        bool is_S_over_flow();
        bool is_S_empty();
};

Stack::Stack (int _size)
{
    arr = new int [_size];
    size = _size;
    size_now = 0;
    top = -1;
}

Stack::~Stack()
{
    delete[] arr;
}

bool Stack::is_S_over_flow()
{
    return size_now == size;
}

bool Stack::is_S_empty()
{
    return size == 0;
}

void Stack::add (int elem)
{
    if (!is_S_over_flow())
    {
        top++;
        arr[top] = elem;
        size_now++;
    }
}

int *Stack::arr_del_last()
{
    int * new_arr = new int [size_now];
    for (int i = 0; i < size_now - 1; i++)
    {
        new_arr[i] = arr[i];
    }
    return new_arr;
}

int Stack::del_last()
{
    if (!is_S_empty())
    {
        int elem_last;
        elem_last = arr[top];
        arr = arr_del_last();
        top--;
        size_now--;
        return elem_last;
    }
}

int main()
{
    int size1, size2, elem;
    string name1, name2;
    cin >> name1 >> size1;
    Stack Stack1 (size1);
    cin >> name2 >> size2;
    Stack Stack2 (size2);
    while (cin >> elem)
    {
        if (!Stack1.is_S_over_flow() and !Stack2.is_S_over_flow())
        {
            Stack1.add (elem);
            Stack2.add (elem);
        }
        else
            break;
    }
    cout << name1 << " " << size1 << endl;
    cout << name2 << " " << size2 << endl;
    cout << name1 << "   " << name2 << endl;
    cout << setw(15) << left << name1 << setw(15) << left << name2 << endl;
    while (!Stack1.is_S_empty() && !Stack2.is_S_empty()) {
        cout << setw(15) << right << Stack1.del_last() << setw(15) << right << Stack2.del_last() << endl;
    }
    return(0);
}