#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define MAX_STRING_LENGTH 6

struct package
{
    char *id;
    int weight;
};

typedef struct package package;

struct post_office
{
    int min_weight;
    int max_weight;
    package* packages;
    int packages_count;
};

typedef struct post_office post_office;

struct town
{
    char* name;
    post_office* offices;
    int offices_count;
};

typedef struct town town;
// (template_head) ----------------------------------------------------------------------

void print_all_packages(const town *t)
{
    printf("%s:\n", t->name);
    for (int i = 0; i < t->offices_count; ++i)
    {
        printf("\t%d:\n", i);
        for (int j = 0; j < t->offices[i].packages_count; ++j)
        {
            printf("\t\t%s\n", t->offices[i].packages[j].id);
        }
    }
}

void send_all_acceptable_packages(town* source, int source_office_index, town* target, int target_office_index)
{
    post_office *src_po = source->offices + source_office_index;
    post_office *dst_po = target->offices + target_office_index;

    for (int i = 0; i < src_po->packages_count; )
    {
        package *p = src_po->packages + i;

        if (dst_po->min_weight <= p->weight && p->weight <= dst_po->max_weight)
        {
            // ok to send package p from src_po to dst_po

            dst_po->packages = realloc(dst_po->packages, (dst_po->packages_count + 1) * sizeof(package));
            dst_po->packages[dst_po->packages_count].id = p->id;		// no need to reallocate
            dst_po->packages[dst_po->packages_count].weight = p->weight;
            dst_po->packages_count++;

            memmove(src_po->packages + i,
                    src_po->packages + i + 1,
                    sizeof(package) * (src_po->packages_count - i - 1));
            src_po->packages_count--;
            src_po->packages = realloc(src_po->packages, sizeof(package) * (src_po->packages_count));
        }
        else
        {
            ++i;
        }
    }
}

town town_with_most_packages(town* towns, int towns_count)
{
    int max_packages = 0;
    int max_i = 0;
    for (int i = 0; i < towns_count; ++i)
    {
        int packages = 0;
        for (int j = 0; j < towns[i].offices_count; ++j)
        {
            packages += towns[i].offices[j].packages_count;
        }
        if (packages >= max_packages)
        {
            max_packages = packages;
            max_i = i;
        }
    }
    return towns[max_i];
}

town* find_town(town* towns, int towns_count, const char* name)
{
    for (int i = 0; i < towns_count; ++i)
    {
        if (strcmp(towns[i].name, name) == 0)
        {
            return towns + i;
        }
    }
    return NULL;
}

// (template_tail) ----------------------------------------------------------------------
int main()
{
    int towns_count;
    scanf("%d", &towns_count);
    town* towns = malloc(sizeof(town)*towns_count);
    for (int i = 0; i < towns_count; i++) {
        towns[i].name = malloc(sizeof(char) * MAX_STRING_LENGTH);
        scanf("%s", towns[i].name);
        scanf("%d", &towns[i].offices_count);
        towns[i].offices = malloc(sizeof(post_office)*towns[i].offices_count);
        for (int j = 0; j < towns[i].offices_count; j++) {
            scanf("%d%d%d", &towns[i].offices[j].packages_count, &towns[i].offices[j].min_weight, &towns[i].offices[j].max_weight);
            towns[i].offices[j].packages = malloc(sizeof(package)*towns[i].offices[j].packages_count);
            for (int k = 0; k < towns[i].offices[j].packages_count; k++) {
                towns[i].offices[j].packages[k].id = malloc(sizeof(char) * MAX_STRING_LENGTH);
                scanf("%s", towns[i].offices[j].packages[k].id);
                scanf("%d", &towns[i].offices[j].packages[k].weight);
            }
        }
    }
    int queries;
    scanf("%d", &queries);
    char town_name[MAX_STRING_LENGTH];
    while (queries--) {
        int type;
        scanf("%d", &type);
fprintf(stderr, "QUERY: %d\n", type);
        switch (type) {
        case 1:
            scanf("%s", town_name);
            town* t = find_town(towns, towns_count, town_name);
            print_all_packages(t);
            break;
        case 2:
            scanf("%s", town_name);
            town* source = find_town(towns, towns_count, town_name);
            int source_index;
            scanf("%d", &source_index);
            scanf("%s", town_name);
            town* target = find_town(towns, towns_count, town_name);
            int target_index;
            scanf("%d", &target_index);
            send_all_acceptable_packages(source, source_index, target, target_index);
            break;
        case 3:
            printf("Town with the most number of packages is %s\n", town_with_most_packages(towns, towns_count).name);
            break;
        }
    }
    return 0;
}