from sys import stdin

class UnionFind():
    def __init__(self, n):
        self.parent_or_size = [-1] * n
        self.weight = [0] * n
        self.ans = [0] * n
        self.cnt = [[[0] * n for i in range(30)] for j in range(2)]
        for i in range(30):
            for j in range(n):
                self.cnt[0][i][j] = 1

    def leader(self, x):
        while self.parent_or_size[x] >= 0: x = self.parent_or_size[x]
        return x

    def merge(self, x, y, w):
        while self.parent_or_size[x] >= 0:
            w ^= self.weight[x]
            x = self.parent_or_size[x]
        while self.parent_or_size[y] >= 0:
            w ^= self.weight[y]
            y = self.parent_or_size[y]
        if self.parent_or_size[x] > self.parent_or_size[y]: x, y = y, x
        self.parent_or_size[x] += self.parent_or_size[y]
        self.parent_or_size[y] = x
        self.weight[y] = w
        self.ans[x] = 0
        for i in range(30):
            self.cnt[((w >> i) & 1)][i][x] += self.cnt[0][i][y]
            self.cnt[1 ^ ((w >> i) & 1)][i][x] += self.cnt[1][i][y]
            self.ans[x] += ((self.cnt[0][i][x] * self.cnt[1][i][x]) % 998244353) << i
            self.ans[x] %= 998244353
    
    def dist(self, x, y):
        res = 0
        while self.parent_or_size[x] >= 0:
            res ^= self.weight[x]
            x = self.parent_or_size[x]
        while self.parent_or_size[y] >= 0:
            res ^= self.weight[y]
            y = self.parent_or_size[y]
        return -1 if x != y else res
        

N, X, Q = map(int, stdin.readline().split())

uf = UnionFind(N)

for _ in range(Q):
    query = list(map(int, stdin.readline().split()))
    if query[0] == 1:
        uf.merge(X, query[1], query[2])
    elif query[0] == 2:
        d = uf.dist(query[1], query[2])
        print(d)
        if d != -1: 
            X += d
            X %= N
    elif query[0] == 3:
        print(uf.ans[uf.leader(query[1])])
    else:
        X += query[1]
        if X >= N: X -= N