#include <stdio.h>
#include <cstdlib>

char map[1000][1000];
int  sizes[1000];

char get_byte(int a, int p) {
    return (a >> 8 * p) & 0x000000ff;
}

int main() {
    int n, a,
        count = 0,
        suma  = 0;

    scanf("%d", &n);

    //Se introduc byte-ii cititi in matricea map
    for (int i = 0; i < n; i++) {
        int m;
        scanf("%d", &m);

        sizes[i] = m * 4;

        for (int j = 0; j < m; j++) {
            scanf("%x", &a);

            for (int z = 0; z < 4; z++) {
                map[i][j * 4 + z] = get_byte(a, z);
            }
        }
    }

    //Se calculeaza suma de pe marginea hartii
    for (int i = 0; i < sizes[0]; i++) {
        suma += map[0][i];
        count++;
    }

    for (int i = 0; i < sizes[n - 1]; i++) {
        suma += map[n - 1][i];
        count++;
    }

    for (int i = 1; i < n - 1; i++) {
        int l = sizes[i];

        suma  += map[i][0] + map[i][l - 1];
        count += 2;
    }

    printf("task 1\n%.7f\n", (double)suma / count);

    //Se aplica modificarile
    int k;
    scanf("%d", &k);

    for (int i = 0; i < k; i++) {
        char operation,
             type;

        int line,
            index;

        int len;

        scanf("\n%c %c %d %d", &operation, &type, &line, &index);

        len = -1;

        switch (type) {
            case 'C':
                len = sizeof(char);
            break;
            case 'S':
                len = sizeof(short);
            break;
            case 'I':
                len = sizeof(int);
            break;
        }

        if (index * len > sizes[line]) {
            sizes[line] += ((index * len - sizes[line]) / 4 + 1) * 4;
        }

        switch (operation) {
            case 'M':
                scanf("%x", &a);

                for (int j = 0; j < len; j++) {
                    map[line][(index - 1) * len + j] = get_byte(a, j);
                }

            break;
            case 'D':
                for (int j = 0; j < len; j++) {
                    map[line][(index - 1) * len + j] = 0x00;
                }
            break;
            case 'S':
                char *tmp = (char *)malloc(4);

                for (int j = 0; j < len; j++) {
                    tmp[j] = map[line][(index) * len + j];
                }

                for (int j = 0; j < len; j++) {
                    map[line][(index) * len + j] = tmp[len - j - 1];
                }
            break;
        }
    }

    //Gaura neagra
   /*
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < sizes[i]; j++) {
            printf("0x%02hhx ", map[i][j]);
        }
        printf("\n");
    }
    */
    printf("task 2\n");
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < sizes[i] / 4; j++) {
            for (int z = 0; z < 4; z++) {
                printf("%02hhx", map[i][j * 4 + 3 - z]);
            }
            printf(" ");
        }
        printf("\n");
    }

    printf("task 3\n");

    return 0;
}