use std::collections::{BTreeMap, BTreeSet};


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

    let mut mapping = BTreeMap::new();
    let mut revmap = vec![0usize; m+1];
    for i in 0..m {
        mapping.entry(a[i]).or_insert(BTreeSet::new()).insert(i+1);
        revmap[i+1] = a[i];
    }
    for &(t, x, y) in queries.iter() {
        if t == 1 {
            mapping.get_mut(&revmap[x]).unwrap().remove(&x);
            if mapping.get(&revmap[x]).unwrap().is_empty() {
                mapping.remove(&revmap[x]);
            }
            mapping.entry(revmap[x]+y).or_insert(BTreeSet::new()).insert(x);
            revmap[x] += y;
        } else if t == 2 {
            mapping.get_mut(&revmap[x]).unwrap().remove(&x);
            if mapping.get(&revmap[x]).unwrap().is_empty() {
                mapping.remove(&revmap[x]);
            }
            mapping.entry(revmap[x]-y).or_insert(BTreeSet::new()).insert(x);
            revmap[x] -= y;
        } else {
            println!("{}", mapping.iter().rev().nth(0).unwrap().1.iter().rev().nth(0).unwrap());
        }
    }
}