Oil Pipeline I

A new industrial complex keeps adding power plants. The complex has $N$ fuel stations numbered 1 to $N$ in a row, and each plant receives its fuel through these stations.

Two kinds of events occur.

• $1$ $L$ $T$: A new power plant enters the complex. It runs only after it receives at least $T$ units of fuel. A pipeline is installed along stations 1 through $L$. If $P$ plants entered before this one, the new plant is numbered $P+1$.
• $2$ $I$ $C$: Every plant with a pipeline that passes station $I$ receives $C$ units of fuel. If any plant starts running because of this event, print the count and the numbers of those plants. Plants that were already running before this event are not printed.

The first line contains $N$ and $Q$, the number of stations and the number of events ($1 \le N \le 100000$, $1 \le Q \le 200000$). Each of the next $Q$ lines describes one event.

Let $last$ be the number of plants that started running at the most recent type 2 event. A type 1 event is given as $1$ $x$ $T$, and $L = x \oplus last$. A type 2 event is given as $2$ $y$ $C$, and $I = y \oplus last$. ($1 \le L \le N$, $1 \le I \le N$, $1 \le T \le 500000$, $1 \le C \le 500000$)

The generated values of $L$ and $I$ are guaranteed to stay within range. The value of $last$ is 0 until the first type 2 event is processed.

For each type 2 event, print one line. The line starts with the number of plants that started running, followed by their numbers in ascending order.