/***
 * Solution to Piles - CodeIT Season 6, Round 6, Problem J1
 * Author - Bozhidar Vasilev
**/

#include <iostream>
#include <stack>
#include <string>
#include <fstream>

using namespace std;

int main()
{
	freopen("piles.in", "r", stdin);
	freopen("piles.out", "w", stdout);
    int n;
    cin >> n;
    stack<int> piles[n];

    int q;
    cin >> q;
    while( q-- )
    {
        string cmd;
        cin >> cmd;
        int p;
        cin >> p;
        int x;
        if( cmd == "ADD" )
        {
            cin >> x;
            piles[p].push(x);
        }
        else
        {
            piles[p].pop();
        }
    }
    for( int i = 0; i < n; ++i )
    {
        if(piles[i].size() == 0)
            cout << "0 ";
        else
            cout << piles[i].top() << " ";
    }
    cout << endl;

    return 0;
}