#include <bits/stdc++.h>
 
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
 
using namespace std;
 
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef double ld;
 
template<class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template<class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }


int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.precision(10);
	cout << fixed;
  
	map<string, vector<int>> m;
	int q;
	cin >> q;
	while(q--){
		int op;
		cin >> op;
		if(op == 0){
			string key;int x;
			cin >> key >> x;
			m[key].push_back(x);
		}else if(op == 1){
			string key;
			cin >> key;
			for(auto i:m[key])cout << i << '\n';
		}else if(op == 2){
			string key;cin >> key;
			m.erase(key);
		}else{
			string lef, rig;
			cin >> lef >> rig;
			auto pos1 = m.lower_bound(lef);
			auto pos2 = m.upper_bound(rig);
			while(pos1 != pos2){
				if(pos1->second.size()){
					for(auto i:pos1->second){
						cout << pos1->first << ' ' << i << '\n';
					}
				}
				pos1++;
			}
		}
			
	}
    return 0;
}

