#include<iostream>
#include<sstream>
#include<algorithm>
#include<climits>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<cfloat>
#include<functional>
#include<map>
#include<string>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<deque>
#include<set>
#include<bitset>
#include<list>
#include<numeric>
#include<complex>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<long long, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<long long, long long> ll_ll;
typedef pair<double, double> d_d;

#define PI 3.141592653589793238462643383279
#define mod 1000000007LL
#define rep(i, n) for(i = 0;i < n;++i)
#define rep1(i, n) for(i = 1;i < n;++i)
#define rep2d(i, j, n) for(i = 0;i < n;++i)for(j = i + 1;j < n;++j)
#define per(i, n) for(i = n - 1;i > -1;--i)
#define int(x) int x; scanf("%d",&x)
#define int2(x, y) int x, y; scanf("%d%d",&x, &y)
#define int3(x, y, z) int x, y, z; scanf("%d%d%d",&x, &y, &z)
#define scn(n, a) rep(i, n)cin >> a[i]
#define sc2n(n, a, b) rep(i, n)cin >> a[i] >> b[i]
#define pri(x) cout << x << "\n"
#define pri2(x, y) cout << x << " " << y << "\n"
#define pri3(x, y, z) cout << x << " " << y << " " << z << "\n"
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define endl "\n"
#define kabe puts("---------------------------")
#define kara puts("")
#define debug(x) cout << " --- " << x << "\n"
#define debug2(x, y) cout << " --- " << x << " " << y << "\n"
#define debug3(x, y, z) cout << " --- " << x << " " << y << " " << z << "\n"
#define X first
#define Y second
#define eps 0.0001
#define prid(x) printf("%.15lf\n", x)

struct wrd{
  string s;
  vector<int> pp;
  void prnt(void){
    cout << s << endl;
    sort(all(pp));
    printf("%d", pp[0]);
    for(int i = 1;i < pp.size();++i)printf(" %d", pp[i]);
    kara;
    return;
  }
};

bool cmp(wrd a, wrd b){
  for(int i = 0;i < min(a.s.size(), b.s.size());++i)if(a.s[i] != b.s[i])
    return a.s[i] < b.s[i];
  return a.s.size() < b.s.size();
}

signed main(void){
  int i, j, k;
  for(int testcase = 0;testcase < 1234567;testcase++){
    vector<wrd> lis;
    string tmp;
    for(;getline(cin, tmp);){
      for(i = 0;i < tmp.size();++i)if(tmp[i] == ' ')break;
      string t = tmp.substr(0, i);

      i++;
      int res = 0;
      for(;i < tmp.size();++i)res = res * 10 + (int)(tmp[i] - '0');

      rep(i, lis.size())if(lis[i].s == t)break;
      if(i != lis.size())lis[i].pp.pb(res);
      else{
        vector<int> qwe;
        qwe.pb(res);
        lis.pb((wrd){t, qwe});
      }
    }

    sort(all(lis), cmp);
    rep(i, lis.size())lis[i].prnt();

/*/

//*/ break;
  }
  return 0;
}