package main import ( "fmt" "bufio" "os" ) type KeyValue struct { key int value int } type SegmentTree struct { n int dat []*KeyValue } func (this *SegmentTree) new(n int) { this.n = 1 for this.n < n { this.n *= 2 } this.dat = make([]*KeyValue, 2*this.n-1) for i := 0; i < 2*this.n-1; i++ { this.dat[i] = &KeyValue{-1, -1} } } func (this *SegmentTree) update(k int, a int) { i := k k += this.n - 1 this.dat[k].key = i this.dat[k].value = a for k > 0 { k = (k - 1) / 2 this.dat[k] = Max(this.dat[k * 2 + 1], this.dat[k * 2 + 2]) } } func (this SegmentTree) max() int { return this.dat[0].key + 1 } func (this SegmentTree) get(i int) int { return this.dat[i + this.n - 1].value } func Max(a *KeyValue, b *KeyValue) *KeyValue{ if a.value > b.value { return a } else if a.value < b.value { return b } else if a.key >= b.key { return a } else { return b } } func main() { r := bufio.NewReader(os.Stdin) w := bufio.NewWriter(os.Stdout) defer w.Flush() var N, M int fmt.Fscan(r, &N, &M) var tree SegmentTree tree.new(M) for i := 0; i < M; i++ { var a int fmt.Fscan(r, &a) tree.update(i, a) } var Q int fmt.Fscan(r, &Q) for i := 0; i < Q; i++ { var t, x, y int fmt.Fscan(r, &t, &x, &y) if t == 1 { tree.update(x-1, tree.get(x-1) + y) } else if t == 2 { tree.update(x-1, tree.get(x-1) - y) } else { fmt.Fprintln(w, tree.max()) } } }