#include <bits/stdc++.h>

using namespace std;
#define rep_i(i, n) for (int i = 0; i < (n); ++i)
#define rep_ll(i, n) for (long long i = 0; i < (n); ++i)
#define r_rep_i(i, start, end) for (int i = (start); i < (end); ++i)
#define r_rep_ll(i, start, end) for (long long i = (start); i < (end); ++i)
#define debug_vi(v) copy((v).begin(), (v).end(), ostream_iterator<int>(cout, " "));
#define debug_vll(v) copy((v).begin(), (v).end(), ostream_iterator<long long>(cout, " "));
#define debug_vd(v) copy((v).begin(), (v).end(), ostream_iterator<double>(cout, " "));
#define sort_v(v) sort((v).begin(), (v).end()); //昇順
#define d_sort_vi(v) sort((v).begin(), (v).end(), greater<int>()); //降
#define d_sort_vd(v) sort((v).begin(), (v).end(), greater<double>()); //昇順
#define say(t) cout << (t) << endl;
#define sum_vi(v) accumulate((v).begin(), (v).end(), 0);
#define sum_vll(v)accumulate((v).begin(), (v).end(), 0LL);

int main(){
  multimap<string, int> m;
  int q; cin >> q;
  int command;
  string key;
  int x;
  string L, R;
  rep_i(i, q){
    cin >> command;
    if(command == 0){
      cin >> key >> x;
      m.insert(make_pair(key, x));
    }else if(command == 1){
      cin >> key;
      auto it = m.equal_range(key);
      for (auto i = it.first; i != it.second; i++){
        cout << i->second << endl;
      }
    }else if(command == 2){
      cin >> key;
      // auto it = m.find(key);
      // if(it != m.end()){
        m.erase(key);
      // }
    }else if(command == 3){
      cin >> L >> R;
      auto start = m.lower_bound(L);
      auto end = m.upper_bound(R);
      while (start != end){
        cout << start->first << " " << start->second << endl;
        ++start;
      }
    }
  }
}
  
