#[derive(Debug, Clone)]
struct SegmentTree<F, T> {
    n: usize,
    orgn: usize,
    unit: T,
    mem: Vec<T>,
    operator: F
}

impl<F, T> SegmentTree<F, T> where
T: std::fmt::Debug + Clone,
F: Fn(&T, &T) -> T
{
    fn new(n: usize, unit: T, operator: F) -> Self {
        let mut size = 1usize;
        while size < n { size *= 2; }
        Self {
            n: size,
            orgn: n,
            unit: unit.clone(),
            mem: vec![unit.clone().to_owned(); size*2-1],
            operator: operator,
        }
    }

    fn find_closed(&self, l: usize, r: usize) -> T {
        self.find(l, r+1)
    }

    fn find(&self, l: usize, r: usize) -> T {
        self._find(l, r, 0, 0, self.n)
    }

    fn set(&mut self, pos: usize, val: T) {
        let mut pos = pos + self.n - 1;
        self.mem[pos] = val;
        while pos > 0 {
            pos = self._parent(pos);
            self.mem[pos] = (self.operator)(&self.mem[self._left(pos)], &self.mem[self._right(pos)]).clone().to_owned();
        }
    }

    fn get(&mut self, pos: usize) -> &T {
        &self.mem[pos + self.n - 1]
    }

    fn _find(&self, a: usize, b: usize, nodenum: usize, l: usize, r: usize) -> T {
        if r <= a || b <= l {
            return self.unit.clone();
        } else if a <= l && r <= b {
            return self.mem[nodenum].clone();
        }
        let left = self._find(a, b, self._left(nodenum), l, (l+r)/2);
        let right = self._find(a, b, self._right(nodenum), (l+r)/2, r);
        (self.operator)(&left, &right)
    }
    fn _left(&self, k: usize) -> usize {
        2*k+1
    }
    fn _right(&self, k: usize) -> usize {
        2*k+2
    }
    fn _parent(&self, k: usize) -> usize {
        (k-1)/2
    }
}

fn main() {
    let mut nmq = String::new();
    std::io::stdin().read_line(&mut nmq).ok();
    let nmq: Vec<usize> = nmq.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
    let n = nmq[0];
    let m = nmq[1];
    let q = nmq[2];
    let queries = (0..q).map(|_| {
            let mut temp = String::new();
            std::io::stdin().read_line(&mut temp).ok();
            let temp: Vec<usize> = temp.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
            temp
        })
        .collect::<Vec<_>>();

    let UNIT = (0..n).collect::<Vec<_>>();
    let operator = |l: &Vec<usize>, r: &Vec<usize>| {
        let n = l.len();
        let mut ret = vec![0usize; n];
        for i in 0..n {
            ret[i] = r[l[i]];
        }
        ret
    };
    let mut segtree = SegmentTree::new(m, UNIT, operator);
    for v in queries.iter() {
        let t = v[0];
        if t == 1 {
            let idx = v[1]-1;
            let order = v.iter().skip(2).map(|&v| v-1).collect::<Vec<_>>();
            segtree.set(idx, order);
        } else if t == 2 {
            let r = v[1];
            let val = segtree.find(0, r);
            let mut res = vec![0usize; n];
            for i in 0..n {
                res[val[i]] = i+1;
            }
            println!("{}", res.iter().map(|&v| v.to_string()).collect::<Vec<_>>().join(" "));
        } else {
            let l = v[1]-1;
            let r = v[2]-1;
            let val = segtree.find_closed(l, r);
            println!("{}", (0..n).map(|i| (i as isize - val[i] as isize).abs()).sum::<isize>());
        }
    }
}