#include <algorithm>
#include <cstdio>
#include <vector>

constexpr int MAXN = 200000 + 2;
constexpr int MAXK = 3;
constexpr int MAXLOGN = 20 + 2;

class Observatory {
  public:
    int b, cnt, warnId[MAXK];
    long long lim;
} ob[MAXN];

long long a[MAXN];

std::vector<int> ans, vec[MAXN][MAXLOGN];

int f(int x, int b) {
    return ((x >> b) + 1) << b;
}

void insert(int x) {
    for (int i = 0; i < ob[x].cnt; i ++) {
        vec[ob[x].warnId[i]][ob[x].b].push_back(x);
    }
}

bool valid(int x) {
    long long sum = 0;

    for (int i = 0; i < ob[x].cnt; i ++) {
        sum += f(a[ob[x].warnId[i]], ob[x].b) - 1;
    }

    return sum < ob[x].lim;
}

bool update(int x) {
    bool fl = false;

    while (ob[x].b >= 0 && !valid(x)) {
        ob[x].b --;
        fl = true;
    }

    if (ob[x].b < 0) {
        return ans.push_back(x), false;
    }
    if (!fl) {
        return true;
    }
    return fl ? insert(x), false : true;
}

int main() {
    int n, m;
    scanf("%d%d", &n, &m);

    while (m --) {
        static int last = 0, id = 0;

        int op;
        scanf("%d", &op);

        if (op == 1) {
            id ++;

            scanf("%lld%d", &ob[id].lim, &ob[id].cnt);

            int *seq = ob[id].warnId;

            ob[id].lim ^= last;
            ob[id].b = MAXLOGN;

            for (int i = 0; i < ob[id].cnt; i ++) {
                scanf("%d", &seq[i]);

                ob[id].lim += a[seq[i] ^= last];
            }

            while (!valid(id)) {
                ob[id].b --;
            }

            insert(id);
        } else {
            int x, y;
            scanf("%d%d", &x, &y);

            a[x ^= last] += y ^= last;

            ans.clear();

            for (int b = 0; b < MAXLOGN; b ++) {
                if (!vec[x][b].size() ||
                  a[x] < f(a[x] - y, b)) {
                    continue;
                }

                std::vector<int> tmp;

                for (int id : vec[x][b]) {
                    if (ob[id].b == b && update(id)) {
                        tmp.push_back(id);
                    }
                }

                vec[x][b] = tmp;
            }

            std::sort(ans.begin(), ans.end());

            printf("%d", last = ans.size());

            for (int x : ans) {
                printf(" %d", x);
            }

            putchar('\n');
        }
    }

    return 0;
}