#include <cassert>

#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>

// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
// #include <boost/foreach.hpp>
// #include <boost/range/algorithm.hpp>
#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define ll long long
#define Sort(v) sort(all(v))
//#define INF 1e9
#define LINF 1e18
#define END return 0
#define pb push_back
#define se second
#define fi first
#define pb push_back
#define all(v) (v).begin() , (v).end()
#define MP make_pair
#define int long long
using namespace std;
int day[12]={31,28,31,30,31,30,31,31,30,31,30,31};
// int dx[]={0,1,0,-1};
// int dy[]={1,0,-1,0};
//typedef pair<int,int> P;

const long long MOD=1000000007LL;
bool isupper(char c){if('A'<=c&&c<='Z')return 1;return 0;}
bool islower(char c){if('a'<=c&&c<='z')return 1;return 0;}
bool iskaibun(string s){for(int i=0;i<s.size()/2;i++)if(s[i]!=s[s.size()-i-1])return 0;return 1;}
bool isnumber(char c){return ('0'<=c&&c<='9');}
bool isalpha(char c){return (isupper(c)||islower(c));}
template<typename T> 
void print(vector<T> v){
    for(int i=0;i<v.size();i++){
        if(i)cout<<" ";
        cout<<v[i];
    }
    cout<<endl;
}
int INF=1e18;

template<typename T>
void printendl(vector<T> v){
    for(auto date:v)cout<<date<<endl;
}

template<typename T>
void printvv(vector<vector<T>> v){
    for(int i=0;i<v.size();i++){
        for(int j=0;j<v[i].size();j++){
            if(j)cout<<" ";
            cout<<v[i][j];
        }
        cout<<endl;
    }
}
int gcd(int a,int b){
    if(a<b)swap(a,b);
    if(b==0)return a;
    else return gcd(b,a%b);
}

struct Edge{
    int to,cost;
};
struct S{
    int n;
    char c;
};

vector<bool> eratos(int n){
    vector<bool> prime(n,true);
    prime[0]=false;
    prime[1]=false;
    for(int i=2;i<=n;i++){
        if(prime[i]){
            for(int j=i+i;j<=n;j+=i){
                prime[j]=false;
            }
        }
    }
    return prime;
}

signed main (){
/*
    multimap<string,int> M;
   
  int q;
  cin>>q;
 
  while(q--){
    int cmd;
    cin>>cmd;
     
    if(cmd == 0){
      string key;
      int x;
      cin>>key>>x;
      M.insert(make_pair(key, x));
    }
     
    if(cmd == 1){
      string key;
      cin>>key;
      for(auto it = M.lower_bound(key); it != M.end() && it->first == key; it++){
    cout<<it->second<<endl;
      }
    }
     
    if(cmd == 2){
      string key;
      cin>>key;
      M.erase(key);
    }
 
    if(cmd == 3){
      string l,r;
      cin>>l>>r;
      auto start = M.lower_bound(l);
      auto last = M.upper_bound(r);
      assert(l <= r);
      for(auto it=start; it != last; it++) cout<<it->first<<" "<<it->second<<endl;
    }
  }
  */
    multimap<string,int> mp;
    int q;
    cin>>q;
    rep(i,0,q){
        int cmd;
        cin>>cmd;
        //cout<<cmd<<endl;
        if(cmd==0){
            string key;
            int x;
            cin>>key>>x;
            mp.insert(make_pair(key,x));
        }else if(cmd==1){
            string key;
            cin>>key;
            auto p=mp.equal_range(key);
            for(auto it=p.first;it!=p.second;it++){
                cout<<it->second<<endl;
            }
        }else if(cmd==2){
            string key;
            cin>>key;
            mp.erase(key);
        }else {
            string l,r;
            cin>>l>>r;
            auto itl=mp.lower_bound(l);
            auto itr=mp.upper_bound(r);
            for(auto it=itl;it!=itr;it++){
                cout<<it->first<<" "<<it->second<<endl;
            }
        }

}



    

    
    
}
/*
001
010
011

*/
