Problem: Each item in the game has a level. The higher the level is, the higher basic parameters the item has. We shall consider only the following basic parameters: attack (atk), defense (def) and resistance to different types of impact (res).

Each item belongs to one class. In this problem we will only consider three of such classes: weapon, armor, orb.

Besides, there's a whole new world hidden inside each item. We can increase an item's level travelling to its world. We can also capture the so-called residents in the Item World

Residents are the creatures that live inside items. Each resident gives some bonus to the item in which it is currently located. We will only consider residents of types: gladiator (who improves the item's atk), sentry (who improves def) and physician (who improves res).

Each item has the size parameter. The parameter limits the maximum number of residents that can live inside an item. We can move residents between items. Within one moment of time we can take some resident from an item and move it to some other item if it has a free place for a new resident. We cannot remove a resident from the items and leave outside — any of them should be inside of some item at any moment of time.

Laharl has a certain number of items. He wants to move the residents between items so as to equip himself with weapon, armor and a defensive orb. The weapon's atk should be largest possible in the end. Among all equipping patterns containing weapon's maximum atk parameter we should choose the ones where the armor’s def parameter is the largest possible. Among all such equipment patterns we should choose the one where the defensive orb would have the largest possible res parameter. Values of the parameters def and res of weapon, atk and res of armor and atk and def of orb are indifferent for Laharl.

Find the optimal equipment pattern Laharl can get.

Input

The first line contains number n (3 ≤ n ≤ 100) — representing how many items Laharl has.

Then follow n lines. Each line contains description of an item. The description has the following form: "name class atk def res size" — the item's name, class, basic attack, defense and resistance parameters and its size correspondingly. 

  * name and class are strings and atk, def, res and size are integers. 
  * name consists of lowercase Latin letters and its length can range from 1 to 10, inclusive. 
  * class can be "weapon", "armor" or "orb". 
  * 0 ≤ atk, def, res ≤ 1000. 
  * 1 ≤ size ≤ 10. 



It is guaranteed that Laharl has at least one item of each class.

The next line contains an integer k (1 ≤ k ≤ 1000) — the number of residents.

Then k lines follow. Each of them describes a resident. A resident description looks like: "name type bonus home" — the resident's name, his type, the number of points the resident adds to the item's corresponding parameter and the name of the item which currently contains the resident. 

  * name, type and home are strings and bonus is an integer. 
  * name consists of lowercase Latin letters and its length can range from 1 to 10, inclusive. 
  * type may be "gladiator", "sentry" or "physician". 
  * 1 ≤ bonus ≤ 100. 



It is guaranteed that the number of residents in each item does not exceed the item's size.

The names of all items and residents are pairwise different.

All words and numbers in the input are separated by single spaces.

Output

Print on the first line the name of the weapon in the optimal equipping pattern; then print the number of residents the weapon contains; then print the residents' names.

Print on the second and third lines in the same form the names of the armor and defensive orb as well as the residents they contain. 

Use single spaces for separation.

If there are several possible solutions, print any of them.

Examples

Input

4
sword weapon 10 2 3 2
pagstarmor armor 0 15 3 1
iceorb orb 3 2 13 2
longbow weapon 9 1 2 1
5
mike gladiator 5 longbow
bobby sentry 6 pagstarmor
petr gladiator 7 iceorb
teddy physician 6 sword
blackjack sentry 8 sword


Output

sword 2 petr mike 
pagstarmor 1 blackjack 
iceorb 2 teddy bobby 


Input

4
sword weapon 10 2 3 2
pagstarmor armor 0 15 3 1
iceorb orb 3 2 13 2
longbow weapon 9 1 2 1
6
mike gladiator 5 longbow
bobby sentry 6 pagstarmor
petr gladiator 7 iceorb
teddy physician 6 sword
blackjack sentry 8 sword
joe physician 6 iceorb


Output

longbow 1 mike 
pagstarmor 1 bobby 
iceorb 2 petr joe 

Note

In the second sample we have no free space inside the items, therefore we cannot move the residents between them.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
template <typename T>
inline void SWAP(T &a, T &b) {
  T tmp = a;
  a = b;
  b = tmp;
}
template <typename T>
inline T ABS(const T &val) {
  return val < 0 ? -val : val;
}
template <typename T>
inline T MAX(const T &a, const T &b) {
  return a > b ? a : b;
}
template <typename T>
inline T MIN(const T &a, const T &b) {
  return a < b ? a : b;
}
const int INTinf = 2147483647;
const int nINTinf = 0 - 2147483648;
using namespace std;
int n, k, m;
int places = 0;
struct item;
int bonus[3][10];
struct resid {
  string name;
  int type, param;
  item *parent;
  resid(string name, int type, int param, item *parent) {
    this->name.assign(name.begin(), name.end());
    this->type = type;
    this->param = param;
    this->parent = parent;
  }
  bool operator<(const resid &q) const { return param > q.param; }
};
int cmp(const resid *a, const resid *b) { return *a < *b; }
struct item {
  string name;
  int atk, def, rez, size, type;
  item(string name, int type, int atk, int def, int rez, int size) {
    this->name.assign(name.begin(), name.end());
    this->type = type;
    this->atk = atk;
    this->def = def;
    this->rez = rez;
    this->size = size;
  }
  int getParam() {
    int ret = 0;
    for (int i = 0; i != resids.size(); i++) {
      if (resids[i]->type == type) {
        ret += resids[i]->param;
      }
    }
    switch (type) {
      case 0:
        return ret + atk;
      case 1:
        return ret + def;
      default:
        return ret + rez;
    }
  }
  int getParam2() {
    switch (type) {
      case 0:
        return bonus[0][size - 1] + atk;
      case 1:
        return bonus[1][size - 1] + def;
      default:
        return bonus[2][size - 1] + rez;
    }
  }
  void swap(resid *own, resid *aim) {
    if (own) {
      for (int i = 0; i != aim->parent->resids.size(); i++) {
        if (aim->parent->resids[i] == aim) {
          aim->parent->resids[i] = own;
          own->parent = aim->parent;
          aim->parent = this;
          for (int j = 0; j != resids.size(); j++) {
            if (own == resids[j]) {
              resids[j] = aim;
              return;
            }
          }
        }
      }
    } else {
      for (int i = 0; i != aim->parent->resids.size(); i++) {
        if (aim->parent->resids[i] == aim) {
          for (int j = i + 1; j != aim->parent->resids.size(); j++) {
            aim->parent->resids[j - 1] = aim->parent->resids[j];
          }
          aim->parent->resids.pop_back();
          resids.push_back(aim);
          aim->parent = this;
          return;
        }
      }
    }
  }
  vector<resid *> resids;
};
map<string, item *> items;
bool can = true;
struct vend {
  vector<item *> items[3];
  vector<resid *> resids[3];
  void add(item *it) {
    places += it->size;
    ::items[it->name] = it;
    items[it->type].push_back(it);
  }
  void addR(resid *res) {
    resids[res->type].push_back(res);
    res->parent->resids.push_back(res);
  }
};
vend V;
string str, str2, str3;
int q, w, e, s;
int main() {
  cin >> n;
  for (int i = 0; i != n; i++) {
    cin >> str >> str2 >> q >> w >> e >> s;
    int tt;
    switch (str2[0]) {
      case 'w':
        tt = 0;
        break;
      case 'a':
        tt = 1;
        break;
      case 'o':
        tt = 2;
        break;
    }
    V.add(new item(str, tt, q, w, e, s));
  }
  cin >> m;
  can = (m != places);
  for (int i = 0; i != m; i++) {
    cin >> str >> str2 >> q >> str3;
    int tt;
    switch (str2[0]) {
      case 'g':
        tt = 0;
        break;
      case 's':
        tt = 1;
        break;
      case 'p':
        tt = 2;
        break;
    }
    V.addR(new resid(str, tt, q, items[str3]));
  }
  if (can) {
    sort(V.resids[0].begin(), V.resids[0].end(), cmp);
    sort(V.resids[1].begin(), V.resids[1].end(), cmp);
    sort(V.resids[2].begin(), V.resids[2].end(), cmp);
    memset(bonus, 0, sizeof(bonus));
    for (int i = 0; i != 3; i++) {
      int to = MIN(10, (int)V.resids[i].size());
      if (to) bonus[i][0] = V.resids[i][0]->param;
      if (to)
        for (int j = 1; j != 10; j++) {
          bonus[i][j] = bonus[i][j - 1] + (j >= to ? 0 : V.resids[i][j]->param);
        }
    }
  }
  int MX[] = {-1, -1, -1};
  item *best[3];
  for (int i = 0; i != 3; i++) {
    for (int j = 0; j != V.items[i].size(); j++) {
      int param =
          (can ? V.items[i][j]->getParam2() : V.items[i][j]->getParam());
      if (param > MX[i]) {
        MX[i] = param;
        best[i] = V.items[i][j];
      }
    }
  }
  if (can) {
    for (int i = 0; i != 3; i++) {
      int to = MIN(best[i]->size, (int)V.resids[i].size());
      for (int j = 0; j != to; j++) {
        resid *own;
        if (j >= best[i]->resids.size()) {
          own = 0;
        } else {
          own = best[i]->resids[j];
        }
        best[i]->swap(own, V.resids[i][j]);
      }
    }
  }
  for (int i = 0; i != 3; i++) {
    cout << best[i]->name << ' ' << best[i]->resids.size();
    for (int j = 0; j != best[i]->resids.size(); j++) {
      cout << ' ' << best[i]->resids[j]->name;
    }
    cout << endl;
  }
  return 0;
}