class SegTree:
    """ define what you want to do with 0 index, ex) size = tree_size, func = min or max, sta = default_value """
    
    def __init__(self,size,func,sta):
        self.n = size
        self.size = 1 << size.bit_length()
        self.func = func
        self.sta = sta
        self.tree = [sta]*(2*self.size)

    def set(self,i,x):
        i += self.size
        self.tree[i] = x
        while i > 1:
            i >>= 1
            self.tree[i] = self.func(self.tree[i<<1],self.tree[i<<1 | 1])

    
    def get(self,l,r):
        """ take the value of [l r) with func (min or max)"""
        l += self.size
        r += self.size
        res = self.sta

        while l < r:
            if l & 1:
                res = self.func(self.tree[l],res)
                l += 1
            if r & 1:
                res = self.func(self.tree[r-1],res)
            l >>= 1
            r >>= 1
        return res
        

n,m,q = map(int,input().split())
Q = [list(map(int,input().split())) for i in range(q)]

def func(a,b):
    return [b[aa] for aa in a]
seg = SegTree(m,func,[i for i in range(n)])

def sol(A):
    ans = [0]*n
    for i,a in enumerate(A):
        ans[a] = i+1
    return ans
for q in Q:
    id = q[0]
    if id == 1:
        d = q[1]
        p = [x-1 for x in q[2:]]
        seg.set(d-1,p)

    elif id == 2:
        print(*sol(seg.get(0,q[1])))
    
    else:
        l,r = q[1:]
        a = seg.get(l-1,r)
        ans = 0
        for i in range(n):
            ans += abs(i-a[i])
        print(ans)