void append(int** pparr, int* psize, int pos, int ele) {
    int size = psize[pos] + 1;
    psize[pos] = size;
    pparr[pos] = (int*)realloc(pparr[pos], sizeof(int) * size);
    int* parr = pparr[pos];
    parr[size - 1] = ele;
}

int* dynamicArray(int n, int queries_rows, int queries_columns, int** queries, int* result_count) {
    int count = 0;
    int** pparr = (int**)malloc(sizeof(int*) * n);
    int* panswer = (int*)malloc(sizeof(int) * n);
    int* psize = (int*)malloc(sizeof(int) * n);
    for (int i = 0; i < n; i++) {
        psize[i] = 0;
        pparr[i] = NULL;
    }

    int lastAnswer = 0;
    int queryType, x, y, idx;
    for (int i = 0; i < queries_rows; i++) {
        queryType = queries[i][0];
        x = queries[i][1];
        y = queries[i][2];
        idx = (x ^ lastAnswer) % n;
        if (queryType == 1) {
            append(pparr, psize, idx, y);
        } else {
            lastAnswer = pparr[idx][y % psize[idx]];
            panswer[count] = lastAnswer;
            count++;
        }
    }
    for (int i = 0; i < n; i++)
        free(pparr[i]);
    free(psize);
    free(pparr);
    panswer = (int*)realloc(panswer, sizeof(int) * count);
    *result_count = count;
    return panswer;
}

vector<int> dynamicArray(int n, vector<vector<int>> queries) {
    int lastAnswer = 0;
    vector<int> result;
    vector<vector<int>> arr(n);
    for(auto query: queries) {
        int type = query[0], x = query[1], y = query[2];
        int idx = (x ^ lastAnswer) % n;
        if(type == 1) {
            arr[idx].push_back(y);
        }
        else {
           lastAnswer = arr[idx][y % arr[idx].size()];
           result.push_back(lastAnswer);
        }
    }
    return result;
}