/*
* Author: Arpit Bhayani
* https://arpitbhayani.me
*/
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <deque>
#include <iostream>
#include <list>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define ll long long
#define MIN(a, b) a < b ? a : b
#define MAX(a, b) a > b ? a : b
using namespace std;
int readline(char *str) {
int i = 0;
char ch;
while((ch = getchar()) != '\n') {
str[i++] = ch;
}
str[i] = '\0';
return i;
}
vector<int> *v;
int main(int argc, char *argv[]) {
int n, t, lastAns = 0;
scanf("%d%d", &n, &t);
v = new vector<int>[n];
while(t--) {
int a, x, y;
scanf("%d%d%d", &a, &x, &y);
if(a == 1) {
v[(x ^ lastAns)% n].push_back(y);
}
else {
vector<int> c = v[(x ^ lastAns)% n];
lastAns = c[y % c.size()];
cout << lastAns << endl;
}
}
delete []v;
return 0;
}
System Design for Beginners
A masterclass that helps early engineers and product managers become great at designing scalable systems.
132+ learners
Details →System Design Masterclass
A masterclass that helps you become great at designing scalable, fault-tolerant, and highly available systems.
1000+ learners
Details →Redis Internals
Learn internals of Redis by re-implementing some of the core features in Golang.
98+ learners
Details →