Nastya is a competitive programmer, but she is only studying now. Recently, Denis told her about the way to check if the string is correct bracket sequence. After that, unexpectedly, Nastya came up with a much more complex problem that Denis couldn't solve. Can you solve it? A string $$$s$$$ is given. It consists of $$$k$$$ kinds of pairs of brackets. Each bracket has the form $$$t$$$  — it is an integer, such that $$$1 \leq |t| \leq k$$$. If the bracket has a form $$$t$$$, then:   If $$$t > 0$$$, then it's an opening bracket of the type $$$t$$$.  If $$$t < 0$$$, then it's a closing bracket of the type $$$-t$$$. Thus, there are $$$k$$$ types of pairs of brackets in total. The queries need to be answered:   Replace the bracket at position $$$i$$$ with the bracket of the form $$$t$$$.  Check if the substring from the $$$l$$$-th to $$$r$$$-th position (including) is the correct bracket sequence.  Recall the definition of the correct bracket sequence:    An empty sequence is correct.   If $$$A$$$ and $$$B$$$ are two correct bracket sequences, then their concatenation "$$$A$$$ $$$B$$$" is also correct bracket sequence.   If $$$A$$$ is the correct bracket sequence, $$$c$$$ $$$(1 \leq c \leq k)$$$ is a type of brackets, then the sequence "$$$c$$$ $$$A$$$ $$$-c$$$" is also correct bracket sequence.

The first line contains an integer $$$n$$$ $$$(1 \leq n \leq 10^5)$$$  — length of string and $$$k$$$ $$$(1 \leq k \leq n)$$$  — the number of kinds of pairs of brackets. The second line contains string $$$s$$$ of length $$$n$$$  — $$$n$$$ integers $$$s_1, s_2, \ldots, s_n$$$ $$$(1 \leq |s_i| \leq k)$$$ The third line contains single integer $$$q$$$ $$$(1 \leq q \leq 10^5)$$$  — the number of queries. Each of the following $$$q$$$ lines describes the queries:    $$$1$$$ $$$i$$$ $$$t$$$ - query of the $$$1$$$ type $$$(1 \leq i \leq n, 1 \leq |t| \leq k)$$$.  $$$2$$$ $$$l$$$ $$$r$$$ - query of the $$$2$$$ type $$$(1 \leq l \leq r \leq n)$$$.

For each query of $$$2$$$ type, output "Yes" if the substring from the query is the correct bracket sequence and "No", otherwise. All letters can be displayed in any case.

NoteIn the fourth test, initially, the string is not a correct bracket sequence, so the answer to the first query is "No". After two changes it will be equal to "$$$1$$$ $$$-1$$$", so it is a correct bracket sequence and the answer to the fourth query is "Yes".

package main

import (
	"bufio"
	"fmt"
	"io"
	"math/rand"
	"os"
	"time"
)

const (
	mod    int64 = 1e9 + 9
	maxn   int   = 1e5 + 5
	poolSz int   = 9e6
)

var bpow [maxn]int64

// Treap begin

type trNode struct {
	val, hash  int
	prio       int
	lt, rt, sz int
}

const empty = 0

var (
	ptr = 0
	p   [poolSz]trNode
	st  [100]int
)

func newTreapNode(val int) int {
	ptr++
	p[ptr] = trNode{val, val, rand.Int(), empty, empty, 1}
	return ptr
}

func copyNode(i int) int {
	ptr++
	p[ptr] = p[i]
	return ptr
}

func update(i int) {
	if i == empty {
		return
	}
	lsz := p[p[i].lt].sz
	p[i].sz = lsz + 1 + p[p[i].rt].sz
	p[i].hash =
		int((int64(p[p[i].lt].hash) +
			int64(p[i].val)*bpow[lsz] +
			int64(p[p[i].rt].hash)*bpow[lsz+1]) % mod)
}

func merge(lt, rt int) (i int) {
	ii := &i
	ptr := len(st)
	for lt != empty && rt != empty {
		if p[lt].prio > p[rt].prio {
			*ii = copyNode(lt)
			ptr--
			st[ptr] = *ii
			lt = p[*ii].rt
			ii = &p[*ii].rt
		} else {
			*ii = copyNode(rt)
			ptr--
			st[ptr] = *ii
			rt = p[*ii].lt
			ii = &p[*ii].lt
		}
	}
	if lt == empty {
		*ii = rt
	} else {
		*ii = lt
	}
	for _, n := range st[ptr:] {
		update(n)
	}
	return
}

func split(i, pos int) (lt, rt int) {
	l, r := &lt, &rt
	ptr := len(st)
	for i != empty && 0 < pos && pos < p[i].sz {
		i = copyNode(i)
		ptr--
		st[ptr] = i
		lsz := p[p[i].lt].sz
		if pos <= lsz {
			*r = i
			r = &p[i].lt
			i = p[i].lt
		} else {
			*l = i
			l = &p[i].rt
			i = p[i].rt
			pos -= lsz + 1
		}
	}
	if i == empty {
		*l, *r = empty, empty
	} else if pos <= 0 {
		*l, *r = empty, i
	} else if pos >= p[i].sz {
		*l, *r = i, empty
	}
	for _, n := range st[ptr:] {
		update(n)
	}
	return
}

func prefixHash(i, r int) int64 {
	if i == empty {
		return 0
	}
	if r >= p[i].sz {
		return int64(p[i].hash)
	}
	res := prefixHash(p[i].lt, r)
	lsz := p[p[i].lt].sz
	if r > lsz {
		res = (res + int64(p[i].val)*bpow[lsz] +
			prefixHash(p[i].rt, r-lsz-1)*bpow[lsz+1]) % mod
	}
	return res
}

// Treap end

// SegTree begin

type node struct {
	lt, rt int
	bad    bool
}

var defaultNode = newNode(empty, empty, false)
var badNode = newNode(empty, empty, true)

func newNode(lt, rt int, bad bool) *node {
	return &node{lt, rt, bad}
}

func mergeNodes(lt, rt *node) *node {
	if lt.bad || rt.bad {
		return badNode
	}
	lrsz, rlsz := p[lt.rt].sz, p[rt.lt].sz
	mn := rlsz
	if lrsz < rlsz {
		mn = lrsz
	}
	lrhash := prefixHash(lt.rt, mn)
	rlhash := prefixHash(rt.lt, mn)
	if lrhash != rlhash {
		return badNode
	}
	new := newNode(lt.lt, rt.rt, false)
	if mn == lrsz {
		_, nlr := split(rt.lt, mn)
		new.lt = merge(new.lt, nlr)
	} else {
		_, nrl := split(lt.rt, mn)
		new.rt = merge(new.rt, nrl)
	}
	return new
}

type segTree struct {
	n    int
	tree []*node
}

func nodeForVal(v int) *node {
	if v > 0 {
		return newNode(empty, newTreapNode(v), false)
	}
	return newNode(newTreapNode(-v), empty, false)
}

func newSegTree(a []int) *segTree {
	t := &segTree{}
	t.n = 1
	for t.n < len(a) {
		t.n *= 2
	}
	t.tree = make([]*node, t.n*2)
	for i, v := range a {
		t.tree[i+t.n] = nodeForVal(v)
	}
	for i := len(a); i < t.n; i++ {
		t.tree[i+t.n] = defaultNode
	}
	for i := t.n - 1; i > 0; i-- {
		t.tree[i] = mergeNodes(t.tree[i*2], t.tree[i*2+1])
	}
	return t
}

func (t *segTree) update(i, v int) {
	t.tree[i+t.n] = nodeForVal(v)
	for i = (i + t.n) / 2; i > 0; i /= 2 {
		t.tree[i] = mergeNodes(t.tree[i*2], t.tree[i*2+1])
	}
}

func (t *segTree) query(i, j int) bool {
	lt, rt := defaultNode, defaultNode
	for i, j := i+t.n, j+t.n; i <= j; i, j = (i+1)/2, (j-1)/2 {
		if i%2 == 1 {
			lt = mergeNodes(lt, t.tree[i])
		}
		if j%2 == 0 {
			rt = mergeNodes(t.tree[j], rt)
		}
	}
	res := mergeNodes(lt, rt)
	return !res.bad && p[res.lt].sz == 0 && p[res.rt].sz == 0
}

// SegTree end

func init() {
	rand.Seed(time.Now().Unix())
	base := int64(rand.Intn(int(mod)-maxn) + maxn)
	bpow[0] = 1
	for i := 1; i < maxn; i++ {
		bpow[i] = bpow[i-1] * base % mod
	}
}

// Taking some cues from ecnerwala
// https://codeforces.com/contest/1340/submission/77861280

func main() {
	io := newFastIO(os.Stdin, os.Stdout)
	defer io.Flush()

	n, _ := io.nextInt(), io.nextInt()
	a := io.nextInts(n)

	ptrInitial := ptr
	st := newSegTree(a)

	for q := io.nextInt(); q > 0; q-- {
		if ptr+400 >= poolSz {
			ptr = ptrInitial
			st = newSegTree(a)
		}
		typ := io.nextInt()
		if typ == 1 {
			i, t := io.nextInt()-1, io.nextInt()
			a[i] = t
			st.update(i, t)
		} else {
			oldPtr := ptr
			l, r := io.nextInt()-1, io.nextInt()-1
			if st.query(l, r) {
				io.println("Yes")
			} else {
				io.println("No")
			}
			ptr = oldPtr
		}
	}
}

type fastIO struct {
	*bufio.Reader
	*bufio.Writer
	p [1]byte
}

func newFastIO(r io.Reader, w io.Writer) *fastIO {
	return &fastIO{Reader: bufio.NewReader(r), Writer: bufio.NewWriter(w)}
}

func (f *fastIO) nextInt() int {
	f.Read(f.p[:])
	for f.p[0] <= ' ' {
		f.Read(f.p[:])
	}
	neg := false
	if f.p[0] == '-' {
		neg = true
		f.Read(f.p[:])
	}
	n := 0
	for '0' <= f.p[0] && f.p[0] <= '9' {
		n = n*10 + int(f.p[0]) - '0'
		f.Read(f.p[:])
	}
	if neg {
		return -n
	}
	return n
}

func (f *fastIO) nextInts(n int) []int {
	a := make([]int, n)
	for i := 0; i < n; i++ {
		a[i] = f.nextInt()
	}
	return a
}

func (f *fastIO) println(a ...interface{}) {
	fmt.Fprintln(f.Writer, a...)
}

package main

import (
	"bufio"
	"fmt"
	"io"
	"math/rand"
	"os"
	"time"
)

const (
	mod    int64 = 1e9 + 9
	maxn   int   = 1e5 + 5
	poolSz int   = 9e6
)

var bpow [maxn]int64

// Treap begin

type trNode struct {
	val, hash  int
	prio       int
	lt, rt, sz int
}

const empty = 0

var (
	ptr = 0
	p   [poolSz]trNode
)

func newTreapNode(val int) int {
	ptr++
	p[ptr] = trNode{val, val, rand.Int(), empty, empty, 1}
	return ptr
}

func copyNode(i int) int {
	ptr++
	p[ptr] = p[i]
	return ptr
}

func update(i int) {
	if i == empty {
		return
	}
	lsz := p[p[i].lt].sz
	p[i].sz = lsz + 1 + p[p[i].rt].sz
	p[i].hash =
		int((int64(p[p[i].lt].hash) +
			int64(p[i].val)*bpow[lsz] +
			int64(p[p[i].rt].hash)*bpow[lsz+1]) % mod)
}

func merge(lt, rt int) (i int) {
	if lt == empty {
		return rt
	}
	if rt == empty {
		return lt
	}
	if p[lt].prio > p[rt].prio {
		i = copyNode(lt)
		p[i].rt = merge(p[i].rt, rt)
	} else {
		i = copyNode(rt)
		p[i].lt = merge(lt, p[i].lt)
	}
	update(i)
	return
}

func split(i, pos int) (lt, rt int) {
	if i == empty {
		return empty, empty
	}
	if pos == 0 {
		return empty, i
	}
	if pos >= p[i].sz {
		return i, empty
	}
	lsz := p[p[i].lt].sz
	i = copyNode(i)
	if pos <= lsz {
		lt, p[i].lt = split(p[i].lt, pos)
		rt = i
	} else {
		p[i].rt, rt = split(p[i].rt, pos-lsz-1)
		lt = i
	}
	update(i)
	return
}

func prefixHash(i, r int) int64 {
	if i == empty {
		return 0
	}
	if r >= p[i].sz {
		return int64(p[i].hash)
	}
	res := prefixHash(p[i].lt, r)
	lsz := p[p[i].lt].sz
	if r > lsz {
		res = (res + int64(p[i].val)*bpow[lsz] +
			prefixHash(p[i].rt, r-lsz-1)*bpow[lsz+1]) % mod
	}
	return res
}

// Treap end

// SegTree begin

type node struct {
	lt, rt int
	bad    bool
}

var defaultNode = newNode(empty, empty, false)
var badNode = newNode(empty, empty, true)

func newNode(lt, rt int, bad bool) *node {
	return &node{lt, rt, bad}
}

func mergeNodes(lt, rt *node) *node {
	if lt.bad || rt.bad {
		return badNode
	}
	lrsz, rlsz := p[lt.rt].sz, p[rt.lt].sz
	mn := rlsz
	if lrsz < rlsz {
		mn = lrsz
	}
	lrhash := prefixHash(lt.rt, mn)
	rlhash := prefixHash(rt.lt, mn)
	if lrhash != rlhash {
		return badNode
	}
	new := newNode(lt.lt, rt.rt, false)
	if mn == lrsz {
		_, nlr := split(rt.lt, mn)
		new.lt = merge(new.lt, nlr)
	} else {
		_, nrl := split(lt.rt, mn)
		new.rt = merge(new.rt, nrl)
	}
	return new
}

type segTree struct {
	n    int
	tree []*node
}

func nodeForVal(v int) *node {
	if v > 0 {
		return newNode(empty, newTreapNode(v), false)
	}
	return newNode(newTreapNode(-v), empty, false)
}

func newSegTree(a []int) *segTree {
	t := &segTree{}
	t.n = 1
	for t.n < len(a) {
		t.n *= 2
	}
	t.tree = make([]*node, t.n*2)
	for i, v := range a {
		t.tree[i+t.n] = nodeForVal(v)
	}
	for i := len(a); i < t.n; i++ {
		t.tree[i+t.n] = defaultNode
	}
	for i := t.n - 1; i > 0; i-- {
		t.tree[i] = mergeNodes(t.tree[i*2], t.tree[i*2+1])
	}
	return t
}

func (t *segTree) update(i, v int) {
	t.tree[i+t.n] = nodeForVal(v)
	for i = (i + t.n) / 2; i > 0; i /= 2 {
		t.tree[i] = mergeNodes(t.tree[i*2], t.tree[i*2+1])
	}
}

func (t *segTree) query(i, j int) bool {
	lt, rt := defaultNode, defaultNode
	for i, j := i+t.n, j+t.n; i <= j; i, j = (i+1)/2, (j-1)/2 {
		if i%2 == 1 {
			lt = mergeNodes(lt, t.tree[i])
		}
		if j%2 == 0 {
			rt = mergeNodes(t.tree[j], rt)
		}
	}
	res := mergeNodes(lt, rt)
	return !res.bad && p[res.lt].sz == 0 && p[res.rt].sz == 0
}

// SegTree end

func init() {
	rand.Seed(time.Now().Unix())
	base := int64(rand.Intn(int(mod)-maxn) + maxn)
	bpow[0] = 1
	for i := 1; i < maxn; i++ {
		bpow[i] = bpow[i-1] * base % mod
	}
}

// Taking some cues from ecnerwala
// https://codeforces.com/contest/1340/submission/77861280

func main() {
	io := newFastIO(os.Stdin, os.Stdout)
	defer io.Flush()

	n, _ := io.nextInt(), io.nextInt()
	a := io.nextInts(n)

	ptrInitial := ptr
	st := newSegTree(a)

	for q := io.nextInt(); q > 0; q-- {
		if ptr+400 >= poolSz {
			ptr = ptrInitial
			st = newSegTree(a)
		}
		typ := io.nextInt()
		if typ == 1 {
			i, t := io.nextInt()-1, io.nextInt()
			a[i] = t
			st.update(i, t)
		} else {
			oldPtr := ptr
			l, r := io.nextInt()-1, io.nextInt()-1
			if st.query(l, r) {
				io.println("Yes")
			} else {
				io.println("No")
			}
			ptr = oldPtr
		}
	}
}

type fastIO struct {
	*bufio.Reader
	*bufio.Writer
	p [1]byte
}

func newFastIO(r io.Reader, w io.Writer) *fastIO {
	return &fastIO{Reader: bufio.NewReader(r), Writer: bufio.NewWriter(w)}
}

func (f *fastIO) nextInt() int {
	f.Read(f.p[:])
	for f.p[0] <= ' ' {
		f.Read(f.p[:])
	}
	neg := false
	if f.p[0] == '-' {
		neg = true
		f.Read(f.p[:])
	}
	n := 0
	for '0' <= f.p[0] && f.p[0] <= '9' {
		n = n*10 + int(f.p[0]) - '0'
		f.Read(f.p[:])
	}
	if neg {
		return -n
	}
	return n
}

func (f *fastIO) nextInts(n int) []int {
	a := make([]int, n)
	for i := 0; i < n; i++ {
		a[i] = f.nextInt()
	}
	return a
}

func (f *fastIO) println(a ...interface{}) {
	fmt.Fprintln(f.Writer, a...)
}

package main

import (
	"bufio"
	"fmt"
	"io"
	"math/rand"
	"os"
	"time"
)

const (
	mod    int64 = 1e9 + 9
	maxn   int   = 1e5 + 5
	poolSz int   = 8e6
)

var bpow [maxn]int64

// Treap begin

const empty = 0

var (
	ptr      = 1
	usedCntr = 1
	p        [poolSz]struct {
		val, hash  int
		prio       int
		lt, rt, sz int
		used       int
	}
)

func newTreapNode(val int) int {
	for p[ptr].used == usedCntr {
		ptr++
	}
	p[ptr].val = val
	p[ptr].hash = val
	p[ptr].prio = int(rand.Int31())
	p[ptr].sz = 1
	p[ptr].lt = empty
	p[ptr].rt = empty
	ptr++
	return ptr - 1
}

func copyNode(i int) int {
	for p[ptr].used == usedCntr {
		ptr++
	}
	p[ptr] = p[i]
	ptr++
	return ptr - 1
}

func update(i int) {
	if i == empty {
		return
	}
	lsz := p[p[i].lt].sz
	p[i].sz = lsz + 1 + p[p[i].rt].sz
	p[i].hash =
		int((int64(p[p[i].lt].hash) +
			int64(p[i].val)*bpow[lsz] +
			int64(p[p[i].rt].hash)*bpow[lsz+1]) % mod)
}

func merge(lt, rt int) (i int) {
	if lt == empty {
		return rt
	}
	if rt == empty {
		return lt
	}
	if p[lt].prio > p[rt].prio {
		i = copyNode(lt)
		p[i].rt = merge(p[i].rt, rt)
	} else {
		i = copyNode(rt)
		p[i].lt = merge(lt, p[i].lt)
	}
	update(i)
	return
}

func split(i, pos int) (lt, rt int) {
	if i == empty {
		return empty, empty
	}
	lsz := p[p[i].lt].sz
	i = copyNode(i)
	if pos <= lsz {
		lt, p[i].lt = split(p[i].lt, pos)
		rt = i
	} else {
		p[i].rt, rt = split(p[i].rt, pos-lsz-1)
		lt = i
	}
	update(i)
	return
}

func prefixHash(i, r int) int64 {
	if i == empty {
		return 0
	}
	if r > p[i].sz {
		return int64(p[i].hash)
	}
	res := prefixHash(p[i].lt, r)
	lsz := p[p[i].lt].sz
	if r > lsz {
		res = (res + int64(p[i].val)*bpow[lsz] +
			prefixHash(p[i].rt, r-lsz-1)*bpow[lsz+1]) % mod
	}
	return res
}

func almostFull() bool {
	return ptr+maxn/100 > poolSz
}

func reset() {
	usedCntr++
	ptr = 1
}

func markUsed(i int) {
	if i == empty || p[i].used == usedCntr {
		return
	}
	p[i].used = usedCntr
	markUsed(p[i].lt)
	markUsed(p[i].rt)
}

// Treap end

// SegTree begin

type node struct {
	lt, rt int
	bad    bool
}

var defaultNode = newNode(empty, empty, false)

func newNode(lt, rt int, bad bool) node {
	return node{lt, rt, bad}
}

func mergeNodes(lt, rt node) node {
	if lt.bad || rt.bad {
		return newNode(empty, empty, true)
	}
	lrsz, rlsz := p[lt.rt].sz, p[rt.lt].sz
	mn := rlsz
	if lrsz < rlsz {
		mn = lrsz
	}
	lrhash := prefixHash(lt.rt, mn)
	rlhash := prefixHash(rt.lt, mn)
	if lrhash != rlhash {
		return newNode(empty, empty, true)
	}
	new := newNode(lt.lt, rt.rt, false)
	if mn == lrsz {
		_, nlr := split(rt.lt, mn)
		new.lt = merge(new.lt, nlr)
	} else {
		_, nrl := split(lt.rt, mn)
		new.rt = merge(new.rt, nrl)
	}
	return new
}

type segTree struct {
	n    int
	tree []node
}

func newSegTree(n int) *segTree {
	t := &segTree{}
	t.n = 1
	for t.n < n {
		t.n *= 2
	}
	t.tree = make([]node, t.n*2)
	for i := range t.tree {
		t.tree[i] = defaultNode
	}
	return t
}

func (t *segTree) maybeFree() {
	if almostFull() {
		reset()
		for _, n := range t.tree[1:] {
			markUsed(n.lt)
			markUsed(n.rt)
		}
	}
}

func (t *segTree) update(i, v int) {
	t.maybeFree()
	if v > 0 {
		t.tree[i+t.n] = newNode(empty, newTreapNode(v), false)
	} else {
		t.tree[i+t.n] = newNode(newTreapNode(-v), empty, false)
	}
	for i = (i + t.n) / 2; i > 0; i /= 2 {
		t.tree[i] = mergeNodes(t.tree[i*2], t.tree[i*2+1])
	}
}

func (t *segTree) query(i, j int) bool {
	t.maybeFree()
	lt, rt := defaultNode, defaultNode
	for i, j := i+t.n, j+t.n; i <= j; i, j = (i+1)/2, (j-1)/2 {
		if i%2 == 1 {
			lt = mergeNodes(lt, t.tree[i])
		}
		if j%2 == 0 {
			rt = mergeNodes(t.tree[j], rt)
		}
	}
	res := mergeNodes(lt, rt)
	return !res.bad && p[res.lt].sz == 0 && p[res.rt].sz == 0
}

// SegTree end

func init() {
	rand.Seed(time.Now().Unix())
	base := int64(rand.Intn(int(mod)-maxn) + maxn)
	bpow[0] = 1
	for i := 1; i < maxn; i++ {
		bpow[i] = bpow[i-1] * base % mod
	}
}

func main() {
	io := newFastIO(os.Stdin, os.Stdout)
	defer io.Flush()

	n, _ := io.nextInt(), io.nextInt()
	a := io.nextInts(n)

	st := newSegTree(n)
	for i := 0; i < n; i++ {
		st.update(i, a[i])
	}

	q := io.nextInt()
	for ; q > 0; q-- {
		typ := io.nextInt()
		if typ == 1 {
			i, t := io.nextInt()-1, io.nextInt()
			st.update(i, t)
		} else {
			l, r := io.nextInt()-1, io.nextInt()-1
			if st.query(l, r) {
				io.println("Yes")
			} else {
				io.println("No")
			}
		}
	}
}

type fastIO struct {
	*bufio.Reader
	*bufio.Writer
	p [1]byte
}

func newFastIO(r io.Reader, w io.Writer) *fastIO {
	return &fastIO{Reader: bufio.NewReader(r), Writer: bufio.NewWriter(w)}
}

func (f *fastIO) nextInt() int {
	f.Read(f.p[:])
	for f.p[0] <= ' ' {
		f.Read(f.p[:])
	}
	neg := false
	if f.p[0] == '-' {
		neg = true
		f.Read(f.p[:])
	}
	n := 0
	for '0' <= f.p[0] && f.p[0] <= '9' {
		n = n*10 + int(f.p[0]) - '0'
		f.Read(f.p[:])
	}
	if neg {
		return -n
	}
	return n
}

func (f *fastIO) nextInts(n int) []int {
	a := make([]int, n)
	for i := 0; i < n; i++ {
		a[i] = f.nextInt()
	}
	return a
}

func (f *fastIO) next() string {
	f.Read(f.p[:])
	for f.p[0] <= ' ' {
		f.Read(f.p[:])
	}
	var s []byte
	for f.p[0] > ' ' {
		s = append(s, f.p[0])
		f.Read(f.p[:])
	}
	return string(s)
}

func (f *fastIO) println(a ...interface{}) {
	fmt.Fprintln(f.Writer, a...)
}

func (f *fastIO) print(a ...interface{}) {
	fmt.Fprint(f.Writer, a...)
}

func (f *fastIO) printInts(a ...int) {
	if len(a) > 0 {
		f.print(a[0])
		for _, x := range a[1:] {
			f.print(" ", x)
		}
	}
}

func (f *fastIO) printlnInts(a ...int) {
	f.printInts(a...)
	f.println()
}

package main

import (
	"bufio"
	"fmt"
	"io"
	"math/rand"
	"os"
	"time"
)

const (
	mod    int64 = 1e9 + 9
	maxn   int   = 1e5 + 5
	poolSz int   = 9e6
)

var bpow [maxn]int64

// Treap begin

type trNode struct {
	val, hash  int
	prio       int
	lt, rt, sz int
}

const empty = 0

var (
	ptr = 0
	p   [poolSz]trNode
)

func newTreapNode(val int) int {
	ptr++
	p[ptr] = trNode{val, val, rand.Int(), empty, empty, 1}
	return ptr
}

func copyNode(i int) int {
	ptr++
	p[ptr] = p[i]
	return ptr
}

func update(i int) {
	if i == empty {
		return
	}
	lsz := p[p[i].lt].sz
	p[i].sz = lsz + 1 + p[p[i].rt].sz
	p[i].hash =
		int((int64(p[p[i].lt].hash) +
			int64(p[i].val)*bpow[lsz] +
			int64(p[p[i].rt].hash)*bpow[lsz+1]) % mod)
}

func merge(lt, rt int) (i int) {
	if lt == empty {
		return rt
	}
	if rt == empty {
		return lt
	}
	if p[lt].prio > p[rt].prio {
		i = copyNode(lt)
		p[i].rt = merge(p[i].rt, rt)
	} else {
		i = copyNode(rt)
		p[i].lt = merge(lt, p[i].lt)
	}
	update(i)
	return
}

func split(i, pos int) (lt, rt int) {
	if i == empty {
		return empty, empty
	}
	if pos == 0 {
		return empty, i
	}
	if pos >= p[i].sz {
		return i, empty
	}
	lsz := p[p[i].lt].sz
	i = copyNode(i)
	if pos <= lsz {
		lt, p[i].lt = split(p[i].lt, pos)
		rt = i
	} else {
		p[i].rt, rt = split(p[i].rt, pos-lsz-1)
		lt = i
	}
	update(i)
	return
}

func prefixHash(i, r int) int64 {
	if i == empty {
		return 0
	}
	if r >= p[i].sz {
		return int64(p[i].hash)
	}
	res := prefixHash(p[i].lt, r)
	lsz := p[p[i].lt].sz
	if r > lsz {
		res = (res + int64(p[i].val)*bpow[lsz] +
			prefixHash(p[i].rt, r-lsz-1)*bpow[lsz+1]) % mod
	}
	return res
}

// Treap end

// SegTree begin

type node struct {
	lt, rt int
	bad    bool
}

var defaultNode = newNode(empty, empty, false)
var badNode = newNode(empty, empty, true)

func newNode(lt, rt int, bad bool) *node {
	return &node{lt, rt, bad}
}

func mergeNodes(lt, rt *node) *node {
	if lt.bad || rt.bad {
		return badNode
	}
	lrsz, rlsz := p[lt.rt].sz, p[rt.lt].sz
	mn := rlsz
	if lrsz < rlsz {
		mn = lrsz
	}
	lrhash := prefixHash(lt.rt, mn)
	rlhash := prefixHash(rt.lt, mn)
	if lrhash != rlhash {
		return badNode
	}
	new := newNode(lt.lt, rt.rt, false)
	if mn == lrsz {
		_, nlr := split(rt.lt, mn)
		new.lt = merge(new.lt, nlr)
	} else {
		_, nrl := split(lt.rt, mn)
		new.rt = merge(new.rt, nrl)
	}
	return new
}

type segTree struct {
	n    int
	tree []*node
}

func nodeForVal(v int) *node {
	if v > 0 {
		return newNode(empty, newTreapNode(v), false)
	}
	return newNode(newTreapNode(-v), empty, false)
}

func newSegTree(a []int) *segTree {
	t := &segTree{}
	t.n = 1
	for t.n < len(a) {
		t.n *= 2
	}
	t.tree = make([]*node, t.n*2)
	for i, v := range a {
		t.tree[i+t.n] = nodeForVal(v)
	}
	for i := len(a); i < t.n; i++ {
		t.tree[i+t.n] = defaultNode
	}
	for i := t.n - 1; i > 0; i-- {
		t.tree[i] = mergeNodes(t.tree[i*2], t.tree[i*2+1])
	}
	return t
}

func (t *segTree) update(i, v int) {
	if v > 0 {
		t.tree[i+t.n] = newNode(empty, newTreapNode(v), false)
	} else {
		t.tree[i+t.n] = newNode(newTreapNode(-v), empty, false)
	}
	for i = (i + t.n) / 2; i > 0; i /= 2 {
		t.tree[i] = mergeNodes(t.tree[i*2], t.tree[i*2+1])
	}
}

func (t *segTree) query(i, j int) bool {
	lt, rt := defaultNode, defaultNode
	for i, j := i+t.n, j+t.n; i <= j; i, j = (i+1)/2, (j-1)/2 {
		if i%2 == 1 {
			lt = mergeNodes(lt, t.tree[i])
		}
		if j%2 == 0 {
			rt = mergeNodes(t.tree[j], rt)
		}
	}
	res := mergeNodes(lt, rt)
	return !res.bad && p[res.lt].sz == 0 && p[res.rt].sz == 0
}

// SegTree end

func init() {
	rand.Seed(time.Now().Unix())
	base := int64(rand.Intn(int(mod)-maxn) + maxn)
	bpow[0] = 1
	for i := 1; i < maxn; i++ {
		bpow[i] = bpow[i-1] * base % mod
	}
}

// Taking some cues from ecnerwala
// https://codeforces.com/contest/1340/submission/77861280

func main() {
	io := newFastIO(os.Stdin, os.Stdout)
	defer io.Flush()

	n, _ := io.nextInt(), io.nextInt()
	a := io.nextInts(n)

	ptrInitial := ptr
	st := newSegTree(a)

	for q := io.nextInt(); q > 0; q-- {
		if ptr+400 >= poolSz {
			ptr = ptrInitial
			st = newSegTree(a)
		}
		typ := io.nextInt()
		if typ == 1 {
			i, t := io.nextInt()-1, io.nextInt()
			a[i] = t
			st.update(i, t)
		} else {
			oldPtr := ptr
			l, r := io.nextInt()-1, io.nextInt()-1
			if st.query(l, r) {
				io.println("Yes")
			} else {
				io.println("No")
			}
			ptr = oldPtr
		}
	}
}

type fastIO struct {
	*bufio.Reader
	*bufio.Writer
	p [1]byte
}

func newFastIO(r io.Reader, w io.Writer) *fastIO {
	return &fastIO{Reader: bufio.NewReader(r), Writer: bufio.NewWriter(w)}
}

func (f *fastIO) nextInt() int {
	f.Read(f.p[:])
	for f.p[0] <= ' ' {
		f.Read(f.p[:])
	}
	neg := false
	if f.p[0] == '-' {
		neg = true
		f.Read(f.p[:])
	}
	n := 0
	for '0' <= f.p[0] && f.p[0] <= '9' {
		n = n*10 + int(f.p[0]) - '0'
		f.Read(f.p[:])
	}
	if neg {
		return -n
	}
	return n
}

func (f *fastIO) nextInts(n int) []int {
	a := make([]int, n)
	for i := 0; i < n; i++ {
		a[i] = f.nextInt()
	}
	return a
}

func (f *fastIO) println(a ...interface{}) {
	fmt.Fprintln(f.Writer, a...)
}

package main

import (
	"bufio"
	"fmt"
	"io"
	"math/rand"
	"os"
	"time"
)

const (
	mod    int64 = 1e9 + 9
	maxn   int   = 1e5 + 5
	poolSz int   = 8e6
)

var bpow [maxn]int64

// Treap begin

const empty = 0

var (
	ptr      = 1
	usedCntr = 1
	p        [poolSz]struct {
		val, hash  int
		prio       int
		lt, rt, sz int
		used       int
	}
)

func newTreapNode(val int) int {
	for p[ptr].used == usedCntr {
		ptr++
	}
	p[ptr].val = val
	p[ptr].hash = val
	p[ptr].prio = rand.Int()
	p[ptr].sz = 1
	p[ptr].lt = empty
	p[ptr].rt = empty
	ptr++
	return ptr - 1
}

func copyNode(i int) int {
	for p[ptr].used == usedCntr {
		ptr++
	}
	p[ptr] = p[i]
	ptr++
	return ptr - 1
}

func update(i int) {
	if i == empty {
		return
	}
	lsz := p[p[i].lt].sz
	p[i].sz = lsz + 1 + p[p[i].rt].sz
	p[i].hash =
		int((int64(p[p[i].lt].hash) +
			int64(p[i].val)*bpow[lsz] +
			int64(p[p[i].rt].hash)*bpow[lsz+1]) % mod)
}

func merge(lt, rt int) (i int) {
	if lt == empty {
		return rt
	}
	if rt == empty {
		return lt
	}
	if p[lt].prio > p[rt].prio {
		i = copyNode(lt)
		p[i].rt = merge(p[i].rt, rt)
	} else {
		i = copyNode(rt)
		p[i].lt = merge(lt, p[i].lt)
	}
	update(i)
	return
}

func split(i, pos int) (lt, rt int) {
	if i == empty {
		return empty, empty
	}
	lsz := p[p[i].lt].sz
	i = copyNode(i)
	if pos <= lsz {
		lt, p[i].lt = split(p[i].lt, pos)
		rt = i
	} else {
		p[i].rt, rt = split(p[i].rt, pos-lsz-1)
		lt = i
	}
	update(i)
	return
}

func prefixHash(i, r int) int64 {
	if i == empty {
		return 0
	}
	if r > p[i].sz {
		return int64(p[i].hash)
	}
	res := prefixHash(p[i].lt, r)
	lsz := p[p[i].lt].sz
	if r > lsz {
		res = (res + int64(p[i].val)*bpow[lsz] +
			prefixHash(p[i].rt, r-lsz-1)*bpow[lsz+1]) % mod
	}
	return res
}

func almostFull() bool {
	return ptr+maxn/100 > poolSz
}

func reset() {
	usedCntr++
	ptr = 1
}

func markUsed(i int) {
	if i == empty || p[i].used == usedCntr {
		return
	}
	p[i].used = usedCntr
	markUsed(p[i].lt)
	markUsed(p[i].rt)
}

// Treap end

// SegTree begin

type node struct {
	lt, rt int
	bad    bool
}

var defaultNode = newNode(empty, empty, false)

func newNode(lt, rt int, bad bool) node {
	return node{lt, rt, bad}
}

func mergeNodes(lt, rt node) node {
	if lt.bad || rt.bad {
		return newNode(empty, empty, true)
	}
	lrsz, rlsz := p[lt.rt].sz, p[rt.lt].sz
	mn := rlsz
	if lrsz < rlsz {
		mn = lrsz
	}
	lrhash := prefixHash(lt.rt, mn)
	rlhash := prefixHash(rt.lt, mn)
	if lrhash != rlhash {
		return newNode(empty, empty, true)
	}
	new := newNode(lt.lt, rt.rt, false)
	if mn == lrsz {
		_, nlr := split(rt.lt, mn)
		new.lt = merge(new.lt, nlr)
	} else {
		_, nrl := split(lt.rt, mn)
		new.rt = merge(new.rt, nrl)
	}
	return new
}

type segTree struct {
	n    int
	tree []node
}

func newSegTree(n int) *segTree {
	t := &segTree{}
	t.n = 1
	for t.n < n {
		t.n *= 2
	}
	t.tree = make([]node, t.n*2)
	for i := range t.tree {
		t.tree[i] = defaultNode
	}
	return t
}

func (t *segTree) maybeFree() {
	if almostFull() {
		reset()
		for _, n := range t.tree[1:] {
			markUsed(n.lt)
			markUsed(n.rt)
		}
	}
}

func (t *segTree) update(i, v int) {
	t.maybeFree()
	if v > 0 {
		t.tree[i+t.n] = newNode(empty, newTreapNode(v), false)
	} else {
		t.tree[i+t.n] = newNode(newTreapNode(-v), empty, false)
	}
	for i = (i + t.n) / 2; i > 0; i /= 2 {
		t.tree[i] = mergeNodes(t.tree[i*2], t.tree[i*2+1])
	}
}

func (t *segTree) query(i, j int) bool {
	t.maybeFree()
	lt, rt := defaultNode, defaultNode
	for i, j := i+t.n, j+t.n; i <= j; i, j = (i+1)/2, (j-1)/2 {
		if i%2 == 1 {
			lt = mergeNodes(lt, t.tree[i])
		}
		if j%2 == 0 {
			rt = mergeNodes(t.tree[j], rt)
		}
	}
	res := mergeNodes(lt, rt)
	return !res.bad && p[res.lt].sz == 0 && p[res.rt].sz == 0
}

// SegTree end

func init() {
	rand.Seed(time.Now().Unix())
	base := int64(rand.Intn(int(mod)-maxn) + maxn)
	bpow[0] = 1
	for i := 1; i < maxn; i++ {
		bpow[i] = bpow[i-1] * base % mod
	}
}

func main() {
	io := newFastIO(os.Stdin, os.Stdout)
	defer io.Flush()

	n, _ := io.nextInt(), io.nextInt()
	a := io.nextInts(n)

	st := newSegTree(n)
	for i := 0; i < n; i++ {
		st.update(i, a[i])
	}

	q := io.nextInt()
	for ; q > 0; q-- {
		typ := io.nextInt()
		if typ == 1 {
			i, t := io.nextInt()-1, io.nextInt()
			st.update(i, t)
		} else {
			l, r := io.nextInt()-1, io.nextInt()-1
			if st.query(l, r) {
				io.println("Yes")
			} else {
				io.println("No")
			}
		}
	}
}

type fastIO struct {
	*bufio.Reader
	*bufio.Writer
	p [1]byte
}

func newFastIO(r io.Reader, w io.Writer) *fastIO {
	return &fastIO{Reader: bufio.NewReader(r), Writer: bufio.NewWriter(w)}
}

func (f *fastIO) nextInt() int {
	f.Read(f.p[:])
	for f.p[0] <= ' ' {
		f.Read(f.p[:])
	}
	neg := false
	if f.p[0] == '-' {
		neg = true
		f.Read(f.p[:])
	}
	n := 0
	for '0' <= f.p[0] && f.p[0] <= '9' {
		n = n*10 + int(f.p[0]) - '0'
		f.Read(f.p[:])
	}
	if neg {
		return -n
	}
	return n
}

func (f *fastIO) nextInts(n int) []int {
	a := make([]int, n)
	for i := 0; i < n; i++ {
		a[i] = f.nextInt()
	}
	return a
}

func (f *fastIO) next() string {
	f.Read(f.p[:])
	for f.p[0] <= ' ' {
		f.Read(f.p[:])
	}
	var s []byte
	for f.p[0] > ' ' {
		s = append(s, f.p[0])
		f.Read(f.p[:])
	}
	return string(s)
}

func (f *fastIO) println(a ...interface{}) {
	fmt.Fprintln(f.Writer, a...)
}

func (f *fastIO) print(a ...interface{}) {
	fmt.Fprint(f.Writer, a...)
}

func (f *fastIO) printInts(a ...int) {
	if len(a) > 0 {
		f.print(a[0])
		for _, x := range a[1:] {
			f.print(" ", x)
		}
	}
}

func (f *fastIO) printlnInts(a ...int) {
	f.printInts(a...)
	f.println()
}

package main

import (
	"bufio"
	"fmt"
	"io"
	"math/rand"
	"os"
	"time"
)

const (
	mod    int64 = 1e9 + 9
	maxn   int   = 1e5 + 5
	poolSz int   = 9e6
)

var bpow [maxn]int64

// Treap begin

const empty = 0

var (
	ptr = 0
	p   [poolSz]struct {
		val, hash  int
		prio       int
		lt, rt, sz int
	}
)

func newTreapNode(val int) int {
	ptr++
	p[ptr].val = val
	p[ptr].hash = val
	p[ptr].prio = rand.Int()
	p[ptr].sz = 1
	p[ptr].lt = empty
	p[ptr].rt = empty
	return ptr
}

func copyNode(i int) int {
	ptr++
	p[ptr] = p[i]
	return ptr
}

func update(i int) {
	if i == empty {
		return
	}
	lsz := p[p[i].lt].sz
	p[i].sz = lsz + 1 + p[p[i].rt].sz
	p[i].hash =
		int((int64(p[p[i].lt].hash) +
			int64(p[i].val)*bpow[lsz] +
			int64(p[p[i].rt].hash)*bpow[lsz+1]) % mod)
}

func merge(lt, rt int) (i int) {
	if lt == empty {
		return rt
	}
	if rt == empty {
		return lt
	}
	if p[lt].prio > p[rt].prio {
		i = copyNode(lt)
		p[i].rt = merge(p[i].rt, rt)
	} else {
		i = copyNode(rt)
		p[i].lt = merge(lt, p[i].lt)
	}
	update(i)
	return
}

func split(i, pos int) (lt, rt int) {
	if i == empty {
		return empty, empty
	}
	if pos == 0 {
		return empty, i
	}
	if pos >= p[i].sz {
		return i, empty
	}
	lsz := p[p[i].lt].sz
	i = copyNode(i)
	if pos <= lsz {
		lt, p[i].lt = split(p[i].lt, pos)
		rt = i
	} else {
		p[i].rt, rt = split(p[i].rt, pos-lsz-1)
		lt = i
	}
	update(i)
	return
}

func prefixHash(i, r int) int64 {
	if i == empty {
		return 0
	}
	if r >= p[i].sz {
		return int64(p[i].hash)
	}
	res := prefixHash(p[i].lt, r)
	lsz := p[p[i].lt].sz
	if r > lsz {
		res = (res + int64(p[i].val)*bpow[lsz] +
			prefixHash(p[i].rt, r-lsz-1)*bpow[lsz+1]) % mod
	}
	return res
}

// Treap end

// SegTree begin

type node struct {
	lt, rt int
	bad    bool
}

var defaultNode = newNode(empty, empty, false)
var badNode = newNode(empty, empty, true)

func newNode(lt, rt int, bad bool) *node {
	return &node{lt, rt, bad}
}

func mergeNodes(lt, rt *node) *node {
	if lt.bad || rt.bad {
		return badNode
	}
	lrsz, rlsz := p[lt.rt].sz, p[rt.lt].sz
	mn := rlsz
	if lrsz < rlsz {
		mn = lrsz
	}
	lrhash := prefixHash(lt.rt, mn)
	rlhash := prefixHash(rt.lt, mn)
	if lrhash != rlhash {
		return badNode
	}
	new := newNode(lt.lt, rt.rt, false)
	if mn == lrsz {
		_, nlr := split(rt.lt, mn)
		new.lt = merge(new.lt, nlr)
	} else {
		_, nrl := split(lt.rt, mn)
		new.rt = merge(new.rt, nrl)
	}
	return new
}

type segTree struct {
	n    int
	tree []*node
}

func nodeForVal(v int) *node {
	if v > 0 {
		return newNode(empty, newTreapNode(v), false)
	}
	return newNode(newTreapNode(-v), empty, false)
}

func newSegTree(a []int) *segTree {
	t := &segTree{}
	t.n = 1
	for t.n < len(a) {
		t.n *= 2
	}
	t.tree = make([]*node, t.n*2)
	for i, v := range a {
		t.tree[i+t.n] = nodeForVal(v)
	}
	for i := len(a); i < t.n; i++ {
		t.tree[i+t.n] = defaultNode
	}
	for i := t.n - 1; i > 0; i-- {
		t.tree[i] = mergeNodes(t.tree[i*2], t.tree[i*2+1])
	}
	return t
}

func (t *segTree) update(i, v int) {
	if v > 0 {
		t.tree[i+t.n] = newNode(empty, newTreapNode(v), false)
	} else {
		t.tree[i+t.n] = newNode(newTreapNode(-v), empty, false)
	}
	for i = (i + t.n) / 2; i > 0; i /= 2 {
		t.tree[i] = mergeNodes(t.tree[i*2], t.tree[i*2+1])
	}
}

func (t *segTree) query(i, j int) bool {
	lt, rt := defaultNode, defaultNode
	for i, j := i+t.n, j+t.n; i <= j; i, j = (i+1)/2, (j-1)/2 {
		if i%2 == 1 {
			lt = mergeNodes(lt, t.tree[i])
		}
		if j%2 == 0 {
			rt = mergeNodes(t.tree[j], rt)
		}
	}
	res := mergeNodes(lt, rt)
	return !res.bad && p[res.lt].sz == 0 && p[res.rt].sz == 0
}

// SegTree end

func init() {
	rand.Seed(time.Now().Unix())
	base := int64(rand.Intn(int(mod)-maxn) + maxn)
	bpow[0] = 1
	for i := 1; i < maxn; i++ {
		bpow[i] = bpow[i-1] * base % mod
	}
}

// Taking some cues from ecnerwala
// https://codeforces.com/contest/1340/submission/77861280

func main() {
	io := newFastIO(os.Stdin, os.Stdout)
	defer io.Flush()

	n, _ := io.nextInt(), io.nextInt()
	a := io.nextInts(n)

	ptrInitial := ptr
	st := newSegTree(a)

	q := io.nextInt()
	for ; q > 0; q-- {
		if ptr+100 >= poolSz {
			ptr = ptrInitial
			st = newSegTree(a)
		}
		typ := io.nextInt()
		if typ == 1 {
			i, t := io.nextInt()-1, io.nextInt()
			a[i] = t
			st.update(i, t)
		} else {
			oldPtr := ptr
			l, r := io.nextInt()-1, io.nextInt()-1
			if st.query(l, r) {
				io.println("Yes")
			} else {
				io.println("No")
			}
			ptr = oldPtr
		}
	}
}

type fastIO struct {
	*bufio.Reader
	*bufio.Writer
	p [1]byte
}

func newFastIO(r io.Reader, w io.Writer) *fastIO {
	return &fastIO{Reader: bufio.NewReader(r), Writer: bufio.NewWriter(w)}
}

func (f *fastIO) nextInt() int {
	f.Read(f.p[:])
	for f.p[0] <= ' ' {
		f.Read(f.p[:])
	}
	neg := false
	if f.p[0] == '-' {
		neg = true
		f.Read(f.p[:])
	}
	n := 0
	for '0' <= f.p[0] && f.p[0] <= '9' {
		n = n*10 + int(f.p[0]) - '0'
		f.Read(f.p[:])
	}
	if neg {
		return -n
	}
	return n
}

func (f *fastIO) nextInts(n int) []int {
	a := make([]int, n)
	for i := 0; i < n; i++ {
		a[i] = f.nextInt()
	}
	return a
}

func (f *fastIO) next() string {
	f.Read(f.p[:])
	for f.p[0] <= ' ' {
		f.Read(f.p[:])
	}
	var s []byte
	for f.p[0] > ' ' {
		s = append(s, f.p[0])
		f.Read(f.p[:])
	}
	return string(s)
}

func (f *fastIO) println(a ...interface{}) {
	fmt.Fprintln(f.Writer, a...)
}

func (f *fastIO) print(a ...interface{}) {
	fmt.Fprint(f.Writer, a...)
}

func (f *fastIO) printInts(a ...int) {
	if len(a) > 0 {
		f.print(a[0])
		for _, x := range a[1:] {
			f.print(" ", x)
		}
	}
}

func (f *fastIO) printlnInts(a ...int) {
	f.printInts(a...)
	f.println()
}

package main

import (
	"bufio"
	"fmt"
	"io"
	"math/rand"
	"os"
	"time"
)

const (
	mod    int64 = 1e9 + 9
	maxn   int   = 1e5 + 5
	poolSz int   = 8e6
)

var bpow [maxn]int64

// Treap begin

const empty = 0

var (
	ptr      = 1
	usedCntr = 1
	p        [poolSz]struct {
		val, hash  int
		prio       int
		lt, rt, sz int
		used       int
	}
)

func newTreapNode(val int) int {
	for p[ptr].used == usedCntr {
		ptr++
	}
	p[ptr].val = val
	p[ptr].hash = val
	p[ptr].prio = rand.Int()
	p[ptr].sz = 1
	p[ptr].lt = empty
	p[ptr].rt = empty
	ptr++
	return ptr - 1
}

func copyNode(i int) int {
	for p[ptr].used == usedCntr {
		ptr++
	}
	p[ptr] = p[i]
	ptr++
	return ptr - 1
}

func update(i int) {
	if i == empty {
		return
	}
	lsz := p[p[i].lt].sz
	p[i].sz = lsz + 1 + p[p[i].rt].sz
	p[i].hash =
		int((int64(p[p[i].lt].hash) +
			int64(p[i].val)*bpow[lsz] +
			int64(p[p[i].rt].hash)*bpow[lsz+1]) % mod)
}

func merge(lt, rt int) (i int) {
	if lt == empty {
		return rt
	}
	if rt == empty {
		return lt
	}
	if p[lt].prio > p[rt].prio {
		i = copyNode(lt)
		p[i].rt = merge(p[i].rt, rt)
	} else {
		i = copyNode(rt)
		p[i].lt = merge(lt, p[i].lt)
	}
	update(i)
	return
}

func split(i, pos int) (lt, rt int) {
	if i == empty {
		return empty, empty
	}
	lsz := p[p[i].lt].sz
	i = copyNode(i)
	if pos <= lsz {
		lt, p[i].lt = split(p[i].lt, pos)
		rt = i
	} else {
		p[i].rt, rt = split(p[i].rt, pos-lsz-1)
		lt = i
	}
	update(i)
	return
}

func prefixHash(i, r int) int64 {
	if i == empty {
		return 0
	}
	if r > p[i].sz {
		return int64(p[i].hash)
	}
	res := prefixHash(p[i].lt, r)
	lsz := p[p[i].lt].sz
	if r > lsz {
		res = (res + int64(p[i].val)*bpow[lsz] +
			prefixHash(p[i].rt, r-lsz-1)*bpow[lsz+1]) % mod
	}
	return res
}

func almostFull() bool {
	return ptr+maxn/100 > poolSz
}

func reset() {
	usedCntr++
	ptr = 1
}

func markUsed(i int) {
	if i == empty || p[i].used == usedCntr {
		return
	}
	p[i].used = usedCntr
	markUsed(p[i].lt)
	markUsed(p[i].rt)
}

// Treap end

// SegTree begin

type node struct {
	lt, rt int
	bad    bool
}

var defaultNode = newNode(empty, empty, false)

func newNode(lt, rt int, bad bool) *node {
	return &node{lt, rt, bad}
}

func mergeNodes(lt, rt *node) *node {
	if lt.bad || rt.bad {
		return newNode(empty, empty, true)
	}
	lrsz, rlsz := p[lt.rt].sz, p[rt.lt].sz
	mn := rlsz
	if lrsz < rlsz {
		mn = lrsz
	}
	lrhash := prefixHash(lt.rt, mn)
	rlhash := prefixHash(rt.lt, mn)
	if lrhash != rlhash {
		return newNode(empty, empty, true)
	}
	new := newNode(lt.lt, rt.rt, false)
	if mn == lrsz {
		_, nlr := split(rt.lt, mn)
		new.lt = merge(new.lt, nlr)
	} else {
		_, nrl := split(lt.rt, mn)
		new.rt = merge(new.rt, nrl)
	}
	return new
}

type segTree struct {
	n    int
	tree []*node
}

func newSegTree(n int) *segTree {
	t := &segTree{}
	t.n = 1
	for t.n < n {
		t.n *= 2
	}
	t.tree = make([]*node, t.n*2)
	for i := range t.tree {
		t.tree[i] = defaultNode
	}
	return t
}

func (t *segTree) maybeFree() {
	if almostFull() {
		reset()
		for _, n := range t.tree[1:] {
			markUsed(n.lt)
			markUsed(n.rt)
		}
	}
}

func (t *segTree) update(i, v int) {
	t.maybeFree()
	if v > 0 {
		t.tree[i+t.n] = newNode(empty, newTreapNode(v), false)
	} else {
		t.tree[i+t.n] = newNode(newTreapNode(-v), empty, false)
	}
	for i = (i + t.n) / 2; i > 0; i /= 2 {
		t.tree[i] = mergeNodes(t.tree[i*2], t.tree[i*2+1])
	}
}

func (t *segTree) query(i, j int) bool {
	t.maybeFree()
	lt, rt := defaultNode, defaultNode
	for i, j := i+t.n, j+t.n; i <= j; i, j = (i+1)/2, (j-1)/2 {
		if i%2 == 1 {
			lt = mergeNodes(lt, t.tree[i])
		}
		if j%2 == 0 {
			rt = mergeNodes(t.tree[j], rt)
		}
	}
	res := mergeNodes(lt, rt)
	return !res.bad && p[res.lt].sz == 0 && p[res.rt].sz == 0
}

// SegTree end

func init() {
	rand.Seed(time.Now().Unix())
	base := int64(rand.Intn(int(mod)-maxn) + maxn)
	bpow[0] = 1
	for i := 1; i < maxn; i++ {
		bpow[i] = bpow[i-1] * base % mod
	}
}

func main() {
	io := newFastIO(os.Stdin, os.Stdout)
	defer io.Flush()

	n, _ := io.nextInt(), io.nextInt()
	a := io.nextInts(n)

	st := newSegTree(n)
	for i := 0; i < n; i++ {
		st.update(i, a[i])
	}

	q := io.nextInt()
	for ; q > 0; q-- {
		typ := io.nextInt()
		if typ == 1 {
			i, t := io.nextInt()-1, io.nextInt()
			st.update(i, t)
		} else {
			l, r := io.nextInt()-1, io.nextInt()-1
			if st.query(l, r) {
				io.println("Yes")
			} else {
				io.println("No")
			}
		}
	}
}

type fastIO struct {
	*bufio.Reader
	*bufio.Writer
	p [1]byte
}

func newFastIO(r io.Reader, w io.Writer) *fastIO {
	return &fastIO{Reader: bufio.NewReader(r), Writer: bufio.NewWriter(w)}
}

func (f *fastIO) nextInt() int {
	f.Read(f.p[:])
	for f.p[0] <= ' ' {
		f.Read(f.p[:])
	}
	neg := false
	if f.p[0] == '-' {
		neg = true
		f.Read(f.p[:])
	}
	n := 0
	for '0' <= f.p[0] && f.p[0] <= '9' {
		n = n*10 + int(f.p[0]) - '0'
		f.Read(f.p[:])
	}
	if neg {
		return -n
	}
	return n
}

func (f *fastIO) nextInts(n int) []int {
	a := make([]int, n)
	for i := 0; i < n; i++ {
		a[i] = f.nextInt()
	}
	return a
}

func (f *fastIO) next() string {
	f.Read(f.p[:])
	for f.p[0] <= ' ' {
		f.Read(f.p[:])
	}
	var s []byte
	for f.p[0] > ' ' {
		s = append(s, f.p[0])
		f.Read(f.p[:])
	}
	return string(s)
}

func (f *fastIO) println(a ...interface{}) {
	fmt.Fprintln(f.Writer, a...)
}

func (f *fastIO) print(a ...interface{}) {
	fmt.Fprint(f.Writer, a...)
}

func (f *fastIO) printInts(a ...int) {
	if len(a) > 0 {
		f.print(a[0])
		for _, x := range a[1:] {
			f.print(" ", x)
		}
	}
}

func (f *fastIO) printlnInts(a ...int) {
	f.printInts(a...)
	f.println()
}

package main

import (
	"bufio"
	"fmt"
	"io"
	"math/rand"
	"os"
	"time"
)

const (
	mod    int64 = 1e9 + 9
	maxn   int   = 1e5 + 5
	poolSz int   = 9.5e6
)

var bpow [maxn]int64

// Treap begin

const empty = 0

var (
	ptr = 0
	p   [poolSz]struct {
		val, hash  int
		prio       int
		lt, rt, sz int
	}
)

func newTreapNode(val int) int {
	ptr++
	p[ptr].val = val
	p[ptr].hash = val
	p[ptr].prio = rand.Int()
	p[ptr].sz = 1
	p[ptr].lt = empty
	p[ptr].rt = empty
	return ptr
}

func copyNode(i int) int {
	ptr++
	p[ptr] = p[i]
	return ptr
}

func update(i int) {
	if i == empty {
		return
	}
	lsz := p[p[i].lt].sz
	p[i].sz = lsz + 1 + p[p[i].rt].sz
	p[i].hash =
		int((int64(p[p[i].lt].hash) +
			int64(p[i].val)*bpow[lsz] +
			int64(p[p[i].rt].hash)*bpow[lsz+1]) % mod)
}

func merge(lt, rt int) (i int) {
	if lt == empty {
		return rt
	}
	if rt == empty {
		return lt
	}
	if p[lt].prio > p[rt].prio {
		i = copyNode(lt)
		p[i].rt = merge(p[i].rt, rt)
	} else {
		i = copyNode(rt)
		p[i].lt = merge(lt, p[i].lt)
	}
	update(i)
	return
}

func split(i, pos int) (lt, rt int) {
	if i == empty {
		return empty, empty
	}
	if pos == 0 {
		return empty, i
	}
	if pos >= p[i].sz {
		return i, empty
	}
	lsz := p[p[i].lt].sz
	i = copyNode(i)
	if pos <= lsz {
		lt, p[i].lt = split(p[i].lt, pos)
		rt = i
	} else {
		p[i].rt, rt = split(p[i].rt, pos-lsz-1)
		lt = i
	}
	update(i)
	return
}

func prefixHash(i, r int) int64 {
	if i == empty {
		return 0
	}
	if r >= p[i].sz {
		return int64(p[i].hash)
	}
	res := prefixHash(p[i].lt, r)
	lsz := p[p[i].lt].sz
	if r > lsz {
		res = (res + int64(p[i].val)*bpow[lsz] +
			prefixHash(p[i].rt, r-lsz-1)*bpow[lsz+1]) % mod
	}
	return res
}

// Treap end

// SegTree begin

type node struct {
	lt, rt int
	bad    bool
}

var defaultNode = newNode(empty, empty, false)
var badNode = newNode(empty, empty, true)

func newNode(lt, rt int, bad bool) *node {
	return &node{lt, rt, bad}
}

func mergeNodes(lt, rt *node) *node {
	if lt.bad || rt.bad {
		return badNode
	}
	lrsz, rlsz := p[lt.rt].sz, p[rt.lt].sz
	mn := rlsz
	if lrsz < rlsz {
		mn = lrsz
	}
	lrhash := prefixHash(lt.rt, mn)
	rlhash := prefixHash(rt.lt, mn)
	if lrhash != rlhash {
		return badNode
	}
	new := newNode(lt.lt, rt.rt, false)
	if mn == lrsz {
		_, nlr := split(rt.lt, mn)
		new.lt = merge(new.lt, nlr)
	} else {
		_, nrl := split(lt.rt, mn)
		new.rt = merge(new.rt, nrl)
	}
	return new
}

type segTree struct {
	n    int
	tree []*node
}

func nodeForVal(v int) *node {
	if v > 0 {
		return newNode(empty, newTreapNode(v), false)
	}
	return newNode(newTreapNode(-v), empty, false)
}

func newSegTree(a []int) *segTree {
	t := &segTree{}
	t.n = 1
	for t.n < len(a) {
		t.n *= 2
	}
	t.tree = make([]*node, t.n*2)
	for i, v := range a {
		t.tree[i+t.n] = nodeForVal(v)
	}
	for i := len(a); i < t.n; i++ {
		t.tree[i+t.n] = defaultNode
	}
	for i := t.n - 1; i > 0; i-- {
		t.tree[i] = mergeNodes(t.tree[i*2], t.tree[i*2+1])
	}
	return t
}

func (t *segTree) update(i, v int) {
	if v > 0 {
		t.tree[i+t.n] = newNode(empty, newTreapNode(v), false)
	} else {
		t.tree[i+t.n] = newNode(newTreapNode(-v), empty, false)
	}
	for i = (i + t.n) / 2; i > 0; i /= 2 {
		t.tree[i] = mergeNodes(t.tree[i*2], t.tree[i*2+1])
	}
}

func (t *segTree) query(i, j int) bool {
	lt, rt := defaultNode, defaultNode
	for i, j := i+t.n, j+t.n; i <= j; i, j = (i+1)/2, (j-1)/2 {
		if i%2 == 1 {
			lt = mergeNodes(lt, t.tree[i])
		}
		if j%2 == 0 {
			rt = mergeNodes(t.tree[j], rt)
		}
	}
	res := mergeNodes(lt, rt)
	return !res.bad && p[res.lt].sz == 0 && p[res.rt].sz == 0
}

// SegTree end

func init() {
	rand.Seed(time.Now().Unix())
	base := int64(rand.Intn(int(mod)-maxn) + maxn)
	bpow[0] = 1
	for i := 1; i < maxn; i++ {
		bpow[i] = bpow[i-1] * base % mod
	}
}

// Taking some cues from ecnerwala
// https://codeforces.com/contest/1340/submission/77861280

func main() {
	io := newFastIO(os.Stdin, os.Stdout)
	defer io.Flush()

	n, _ := io.nextInt(), io.nextInt()
	a := io.nextInts(n)

	ptrInitial := ptr
	st := newSegTree(a)

	q := io.nextInt()
	for ; q > 0; q-- {
		if ptr+100 >= poolSz {
			ptr = ptrInitial
			st = newSegTree(a)
		}
		typ := io.nextInt()
		if typ == 1 {
			i, t := io.nextInt()-1, io.nextInt()
			st.update(i, t)
		} else {
			oldPtr := ptr
			l, r := io.nextInt()-1, io.nextInt()-1
			if st.query(l, r) {
				io.println("Yes")
			} else {
				io.println("No")
			}
			ptr = oldPtr
		}
	}
}

type fastIO struct {
	*bufio.Reader
	*bufio.Writer
	p [1]byte
}

func newFastIO(r io.Reader, w io.Writer) *fastIO {
	return &fastIO{Reader: bufio.NewReader(r), Writer: bufio.NewWriter(w)}
}

func (f *fastIO) nextInt() int {
	f.Read(f.p[:])
	for f.p[0] <= ' ' {
		f.Read(f.p[:])
	}
	neg := false
	if f.p[0] == '-' {
		neg = true
		f.Read(f.p[:])
	}
	n := 0
	for '0' <= f.p[0] && f.p[0] <= '9' {
		n = n*10 + int(f.p[0]) - '0'
		f.Read(f.p[:])
	}
	if neg {
		return -n
	}
	return n
}

func (f *fastIO) nextInts(n int) []int {
	a := make([]int, n)
	for i := 0; i < n; i++ {
		a[i] = f.nextInt()
	}
	return a
}

func (f *fastIO) next() string {
	f.Read(f.p[:])
	for f.p[0] <= ' ' {
		f.Read(f.p[:])
	}
	var s []byte
	for f.p[0] > ' ' {
		s = append(s, f.p[0])
		f.Read(f.p[:])
	}
	return string(s)
}

func (f *fastIO) println(a ...interface{}) {
	fmt.Fprintln(f.Writer, a...)
}

func (f *fastIO) print(a ...interface{}) {
	fmt.Fprint(f.Writer, a...)
}

func (f *fastIO) printInts(a ...int) {
	if len(a) > 0 {
		f.print(a[0])
		for _, x := range a[1:] {
			f.print(" ", x)
		}
	}
}

func (f *fastIO) printlnInts(a ...int) {
	f.printInts(a...)
	f.println()
}

package main

import (
	"bufio"
	"fmt"
	"io"
	"math/rand"
	"os"
	"time"
)

const (
	mod    int64 = 1e9 + 9
	maxn   int   = 1e5 + 5
	poolSz int   = 8e6
)

var bpow [maxn]int64

// Treap begin

const empty = 0

var (
	ptr      = 1
	usedCntr = 1
	p        [poolSz]struct {
		val, hash  int
		prio       int
		lt, rt, sz int
		used       int
	}
)

func newTreapNode(val int) int {
	for p[ptr].used == usedCntr {
		ptr++
	}
	p[ptr].val = val
	p[ptr].hash = val
	p[ptr].prio = rand.Int()
	p[ptr].sz = 1
	p[ptr].lt = empty
	p[ptr].rt = empty
	ptr++
	return ptr - 1
}

func copyNode(i int) int {
	for p[ptr].used == usedCntr {
		ptr++
	}
	p[ptr] = p[i]
	ptr++
	return ptr - 1
}

func update(i int) {
	if i == empty {
		return
	}
	lsz := p[p[i].lt].sz
	p[i].sz = lsz + 1 + p[p[i].rt].sz
	p[i].hash =
		int((int64(p[p[i].lt].hash) +
			int64(p[i].val)*bpow[lsz] +
			int64(p[p[i].rt].hash)*bpow[lsz+1]) % mod)
}

func merge(lt, rt int) (i int) {
	if lt == empty {
		return rt
	}
	if rt == empty {
		return lt
	}
	if p[lt].prio > p[rt].prio {
		i = copyNode(lt)
		p[i].rt = merge(p[i].rt, rt)
	} else {
		i = copyNode(rt)
		p[i].lt = merge(lt, p[i].lt)
	}
	update(i)
	return
}

func split(i, pos int) (lt, rt int) {
	if i == empty {
		return empty, empty
	}
	if pos == 0 {
		return empty, i
	}
	if pos >= p[i].sz {
		return i, empty
	}
	lsz := p[p[i].lt].sz
	i = copyNode(i)
	if pos <= lsz {
		lt, p[i].lt = split(p[i].lt, pos)
		rt = i
	} else {
		p[i].rt, rt = split(p[i].rt, pos-lsz-1)
		lt = i
	}
	update(i)
	return
}

func prefixHash(i, r int) int64 {
	if i == empty {
		return 0
	}
	if r > p[i].sz {
		return int64(p[i].hash)
	}
	res := prefixHash(p[i].lt, r)
	lsz := p[p[i].lt].sz
	if r > lsz {
		res = (res + int64(p[i].val)*bpow[lsz] +
			prefixHash(p[i].rt, r-lsz-1)*bpow[lsz+1]) % mod
	}
	return res
}

func almostFull() bool {
	return ptr+maxn/100 > poolSz
}

func reset() {
	usedCntr++
	ptr = 1
}

func markUsed(i int) {
	if i == empty || p[i].used == usedCntr {
		return
	}
	p[i].used = usedCntr
	markUsed(p[i].lt)
	markUsed(p[i].rt)
}

// Treap end

// SegTree begin

type node struct {
	lt, rt int
	bad    bool
}

var defaultNode = newNode(empty, empty, false)

func newNode(lt, rt int, bad bool) *node {
	return &node{lt, rt, bad}
}

func mergeNodes(lt, rt *node) *node {
	if lt.bad || rt.bad {
		return newNode(empty, empty, true)
	}
	lrsz, rlsz := p[lt.rt].sz, p[rt.lt].sz
	mn := rlsz
	if lrsz < rlsz {
		mn = lrsz
	}
	lrhash := prefixHash(lt.rt, mn)
	rlhash := prefixHash(rt.lt, mn)
	if lrhash != rlhash {
		return newNode(empty, empty, true)
	}
	new := newNode(lt.lt, rt.rt, false)
	if mn == lrsz {
		_, nlr := split(rt.lt, mn)
		new.lt = merge(new.lt, nlr)
	} else {
		_, nrl := split(lt.rt, mn)
		new.rt = merge(new.rt, nrl)
	}
	return new
}

type segTree struct {
	n    int
	tree []*node
}

func newSegTree(n int) *segTree {
	t := &segTree{}
	t.n = 1
	for t.n < n {
		t.n *= 2
	}
	t.tree = make([]*node, t.n*2)
	for i := range t.tree {
		t.tree[i] = defaultNode
	}
	return t
}

func (t *segTree) maybeFree() {
	if almostFull() {
		reset()
		for _, n := range t.tree[1:] {
			markUsed(n.lt)
			markUsed(n.rt)
		}
	}
}

func (t *segTree) update(i, v int) {
	t.maybeFree()
	if v > 0 {
		t.tree[i+t.n] = newNode(empty, newTreapNode(v), false)
	} else {
		t.tree[i+t.n] = newNode(newTreapNode(-v), empty, false)
	}
	for i = (i + t.n) / 2; i > 0; i /= 2 {
		t.tree[i] = mergeNodes(t.tree[i*2], t.tree[i*2+1])
	}
}

func (t *segTree) query(i, j int) bool {
	t.maybeFree()
	lt, rt := defaultNode, defaultNode
	for i, j := i+t.n, j+t.n; i <= j; i, j = (i+1)/2, (j-1)/2 {
		if i%2 == 1 {
			lt = mergeNodes(lt, t.tree[i])
		}
		if j%2 == 0 {
			rt = mergeNodes(t.tree[j], rt)
		}
	}
	res := mergeNodes(lt, rt)
	return !res.bad && p[res.lt].sz == 0 && p[res.rt].sz == 0
}

// SegTree end

func init() {
	rand.Seed(time.Now().Unix())
	base := int64(rand.Intn(int(mod)-maxn) + maxn)
	bpow[0] = 1
	for i := 1; i < maxn; i++ {
		bpow[i] = bpow[i-1] * base % mod
	}
}

func main() {
	io := newFastIO(os.Stdin, os.Stdout)
	defer io.Flush()

	n, _ := io.nextInt(), io.nextInt()
	a := io.nextInts(n)

	st := newSegTree(n)
	for i := 0; i < n; i++ {
		st.update(i, a[i])
	}

	q := io.nextInt()
	for ; q > 0; q-- {
		typ := io.nextInt()
		if typ == 1 {
			i, t := io.nextInt()-1, io.nextInt()
			st.update(i, t)
		} else {
			l, r := io.nextInt()-1, io.nextInt()-1
			if st.query(l, r) {
				io.println("Yes")
			} else {
				io.println("No")
			}
		}
	}
}

type fastIO struct {
	*bufio.Reader
	*bufio.Writer
	p [1]byte
}

func newFastIO(r io.Reader, w io.Writer) *fastIO {
	return &fastIO{Reader: bufio.NewReader(r), Writer: bufio.NewWriter(w)}
}

func (f *fastIO) nextInt() int {
	f.Read(f.p[:])
	for f.p[0] <= ' ' {
		f.Read(f.p[:])
	}
	neg := false
	if f.p[0] == '-' {
		neg = true
		f.Read(f.p[:])
	}
	n := 0
	for '0' <= f.p[0] && f.p[0] <= '9' {
		n = n*10 + int(f.p[0]) - '0'
		f.Read(f.p[:])
	}
	if neg {
		return -n
	}
	return n
}

func (f *fastIO) nextInts(n int) []int {
	a := make([]int, n)
	for i := 0; i < n; i++ {
		a[i] = f.nextInt()
	}
	return a
}

func (f *fastIO) next() string {
	f.Read(f.p[:])
	for f.p[0] <= ' ' {
		f.Read(f.p[:])
	}
	var s []byte
	for f.p[0] > ' ' {
		s = append(s, f.p[0])
		f.Read(f.p[:])
	}
	return string(s)
}

func (f *fastIO) println(a ...interface{}) {
	fmt.Fprintln(f.Writer, a...)
}

func (f *fastIO) print(a ...interface{}) {
	fmt.Fprint(f.Writer, a...)
}

func (f *fastIO) printInts(a ...int) {
	if len(a) > 0 {
		f.print(a[0])
		for _, x := range a[1:] {
			f.print(" ", x)
		}
	}
}

func (f *fastIO) printlnInts(a ...int) {
	f.printInts(a...)
	f.println()
}

package main

import (
	"bufio"
	"fmt"
	"io"
	"math/rand"
	"os"
	"time"
)

const (
	mod    int64 = 1e9 + 9
	maxn   int   = 1e5 + 5
	poolSz int   = 9e6
)

var bpow [maxn]int64

// Treap begin

type trNode struct {
	val, hash  int
	prio       int
	lt, rt, sz int
}

const empty = 0

var (
	ptr = 0
	p   [poolSz]trNode
)

func newTreapNode(val int) int {
	ptr++
	p[ptr] = trNode{val, val, rand.Int(), empty, empty, 1}
	return ptr
}

func copyNode(i int) int {
	ptr++
	p[ptr] = p[i]
	return ptr
}

func update(i int) {
	if i == empty {
		return
	}
	lsz := p[p[i].lt].sz
	p[i].sz = lsz + 1 + p[p[i].rt].sz
	p[i].hash =
		int((int64(p[p[i].lt].hash) +
			int64(p[i].val)*bpow[lsz] +
			int64(p[p[i].rt].hash)*bpow[lsz+1]) % mod)
}

func merge(lt, rt int) (i int) {
	ii := &i
	for lt != empty && rt != empty {
		if p[lt].prio > p[rt].prio {
			*ii = copyNode(lt)
			defer update(*ii)
			lt = p[*ii].rt
			ii = &p[*ii].rt
		} else {
			*ii = copyNode(rt)
			defer update(*ii)
			rt = p[*ii].lt
			ii = &p[*ii].lt
		}
	}
	if lt == empty {
		*ii = rt
	} else {
		*ii = lt
	}
	return
}

func split(i, pos int) (lt, rt int) {
	l, r := &lt, &rt
	for i != empty && 0 < pos && pos < p[i].sz {
		i = copyNode(i)
		defer update(i)
		lsz := p[p[i].lt].sz
		if pos <= lsz {
			*r = i
			r = &p[i].lt
			i = p[i].lt
		} else {
			*l = i
			l = &p[i].rt
			i = p[i].rt
			pos -= lsz + 1
		}
	}
	if i == empty {
		*l, *r = empty, empty
	} else if pos <= 0 {
		*l, *r = empty, i
	} else if pos >= p[i].sz {
		*l, *r = i, empty
	}
	return
}

func prefixHash(i, r int) int64 {
	if i == empty {
		return 0
	}
	if r >= p[i].sz {
		return int64(p[i].hash)
	}
	res := prefixHash(p[i].lt, r)
	lsz := p[p[i].lt].sz
	if r > lsz {
		res = (res + int64(p[i].val)*bpow[lsz] +
			prefixHash(p[i].rt, r-lsz-1)*bpow[lsz+1]) % mod
	}
	return res
}

// Treap end

// SegTree begin

type node struct {
	lt, rt int
	bad    bool
}

var defaultNode = newNode(empty, empty, false)
var badNode = newNode(empty, empty, true)

func newNode(lt, rt int, bad bool) *node {
	return &node{lt, rt, bad}
}

func mergeNodes(lt, rt *node) *node {
	if lt.bad || rt.bad {
		return badNode
	}
	lrsz, rlsz := p[lt.rt].sz, p[rt.lt].sz
	mn := rlsz
	if lrsz < rlsz {
		mn = lrsz
	}
	lrhash := prefixHash(lt.rt, mn)
	rlhash := prefixHash(rt.lt, mn)
	if lrhash != rlhash {
		return badNode
	}
	new := newNode(lt.lt, rt.rt, false)
	if mn == lrsz {
		_, nlr := split(rt.lt, mn)
		new.lt = merge(new.lt, nlr)
	} else {
		_, nrl := split(lt.rt, mn)
		new.rt = merge(new.rt, nrl)
	}
	return new
}

type segTree struct {
	n    int
	tree []*node
}

func nodeForVal(v int) *node {
	if v > 0 {
		return newNode(empty, newTreapNode(v), false)
	}
	return newNode(newTreapNode(-v), empty, false)
}

func newSegTree(a []int) *segTree {
	t := &segTree{}
	t.n = 1
	for t.n < len(a) {
		t.n *= 2
	}
	t.tree = make([]*node, t.n*2)
	for i, v := range a {
		t.tree[i+t.n] = nodeForVal(v)
	}
	for i := len(a); i < t.n; i++ {
		t.tree[i+t.n] = defaultNode
	}
	for i := t.n - 1; i > 0; i-- {
		t.tree[i] = mergeNodes(t.tree[i*2], t.tree[i*2+1])
	}
	return t
}

func (t *segTree) update(i, v int) {
	t.tree[i+t.n] = nodeForVal(v)
	for i = (i + t.n) / 2; i > 0; i /= 2 {
		t.tree[i] = mergeNodes(t.tree[i*2], t.tree[i*2+1])
	}
}

func (t *segTree) query(i, j int) bool {
	lt, rt := defaultNode, defaultNode
	for i, j := i+t.n, j+t.n; i <= j; i, j = (i+1)/2, (j-1)/2 {
		if i%2 == 1 {
			lt = mergeNodes(lt, t.tree[i])
		}
		if j%2 == 0 {
			rt = mergeNodes(t.tree[j], rt)
		}
	}
	res := mergeNodes(lt, rt)
	return !res.bad && p[res.lt].sz == 0 && p[res.rt].sz == 0
}

// SegTree end

func init() {
	rand.Seed(time.Now().Unix())
	base := int64(rand.Intn(int(mod)-maxn) + maxn)
	bpow[0] = 1
	for i := 1; i < maxn; i++ {
		bpow[i] = bpow[i-1] * base % mod
	}
}

// Taking some cues from ecnerwala
// https://codeforces.com/contest/1340/submission/77861280

func main() {
	io := newFastIO(os.Stdin, os.Stdout)
	defer io.Flush()

	n, _ := io.nextInt(), io.nextInt()
	a := io.nextInts(n)

	ptrInitial := ptr
	st := newSegTree(a)

	for q := io.nextInt(); q > 0; q-- {
		if ptr+400 >= poolSz {
			ptr = ptrInitial
			st = newSegTree(a)
		}
		typ := io.nextInt()
		if typ == 1 {
			i, t := io.nextInt()-1, io.nextInt()
			a[i] = t
			st.update(i, t)
		} else {
			oldPtr := ptr
			l, r := io.nextInt()-1, io.nextInt()-1
			if st.query(l, r) {
				io.println("Yes")
			} else {
				io.println("No")
			}
			ptr = oldPtr
		}
	}
}

type fastIO struct {
	*bufio.Reader
	*bufio.Writer
	p [1]byte
}

func newFastIO(r io.Reader, w io.Writer) *fastIO {
	return &fastIO{Reader: bufio.NewReader(r), Writer: bufio.NewWriter(w)}
}

func (f *fastIO) nextInt() int {
	f.Read(f.p[:])
	for f.p[0] <= ' ' {
		f.Read(f.p[:])
	}
	neg := false
	if f.p[0] == '-' {
		neg = true
		f.Read(f.p[:])
	}
	n := 0
	for '0' <= f.p[0] && f.p[0] <= '9' {
		n = n*10 + int(f.p[0]) - '0'
		f.Read(f.p[:])
	}
	if neg {
		return -n
	}
	return n
}

func (f *fastIO) nextInts(n int) []int {
	a := make([]int, n)
	for i := 0; i < n; i++ {
		a[i] = f.nextInt()
	}
	return a
}

func (f *fastIO) println(a ...interface{}) {
	fmt.Fprintln(f.Writer, a...)
}

package main

import (
	"bufio"
	"fmt"
	"io"
	"math/rand"
	"os"
	"time"
)

const (
	mod    int64 = 1e9 + 9
	maxn   int   = 1e5 + 5
	poolSz int   = 8e6
)

var bpow [maxn]int64

// Treap begin

const empty = 0

var (
	ptr      = 1
	usedCntr = 1
	p        [poolSz]struct {
		val, hash  int
		prio       int
		lt, rt, sz int
		used       int
	}
)

func newTreapNode(val int) int {
	for p[ptr].used == usedCntr {
		ptr++
	}
	p[ptr].val = val
	p[ptr].hash = val
	p[ptr].prio = rand.Int()
	p[ptr].sz = 1
	p[ptr].lt = empty
	p[ptr].rt = empty
	ptr++
	return ptr - 1
}

func copyNode(i int) int {
	for p[ptr].used == usedCntr {
		ptr++
	}
	p[ptr] = p[i]
	ptr++
	return ptr - 1
}

func update(i int) {
	if i == empty {
		return
	}
	lsz := p[p[i].lt].sz
	p[i].sz = lsz + 1 + p[p[i].rt].sz
	p[i].hash =
		int((int64(p[p[i].lt].hash) +
			int64(p[i].val)*bpow[lsz] +
			int64(p[p[i].rt].hash)*bpow[lsz+1]) % mod)
}

func merge(lt, rt int) (i int) {
	if lt == empty {
		return rt
	}
	if rt == empty {
		return lt
	}
	if p[lt].prio > p[rt].prio {
		i = copyNode(lt)
		p[i].rt = merge(p[i].rt, rt)
	} else {
		i = copyNode(rt)
		p[i].lt = merge(lt, p[i].lt)
	}
	update(i)
	return
}

func split(i, pos int) (lt, rt int) {
	if i == empty {
		return empty, empty
	}
	if pos == 0 {
		return empty, i
	}
	if pos >= p[i].sz {
		return i, empty
	}
	lsz := p[p[i].lt].sz
	i = copyNode(i)
	if pos <= lsz {
		lt, p[i].lt = split(p[i].lt, pos)
		rt = i
	} else {
		p[i].rt, rt = split(p[i].rt, pos-lsz-1)
		lt = i
	}
	update(i)
	return
}

func prefixHash(i, r int) int64 {
	if i == empty {
		return 0
	}
	if r >= p[i].sz {
		return int64(p[i].hash)
	}
	res := prefixHash(p[i].lt, r)
	lsz := p[p[i].lt].sz
	if r > lsz {
		res = (res + int64(p[i].val)*bpow[lsz] +
			prefixHash(p[i].rt, r-lsz-1)*bpow[lsz+1]) % mod
	}
	return res
}

func almostFull() bool {
	return ptr+maxn/100 > poolSz
}

func reset() {
	usedCntr++
	ptr = 1
}

func markUsed(i int) {
	if i == empty || p[i].used == usedCntr {
		return
	}
	p[i].used = usedCntr
	markUsed(p[i].lt)
	markUsed(p[i].rt)
}

// Treap end

// SegTree begin

type node struct {
	lt, rt int
	bad    bool
}

var defaultNode = newNode(empty, empty, false)

func newNode(lt, rt int, bad bool) *node {
	return &node{lt, rt, bad}
}

func mergeNodes(lt, rt *node) *node {
	if lt.bad || rt.bad {
		return newNode(empty, empty, true)
	}
	lrsz, rlsz := p[lt.rt].sz, p[rt.lt].sz
	mn := rlsz
	if lrsz < rlsz {
		mn = lrsz
	}
	lrhash := prefixHash(lt.rt, mn)
	rlhash := prefixHash(rt.lt, mn)
	if lrhash != rlhash {
		return newNode(empty, empty, true)
	}
	new := newNode(lt.lt, rt.rt, false)
	if mn == lrsz {
		_, nlr := split(rt.lt, mn)
		new.lt = merge(new.lt, nlr)
	} else {
		_, nrl := split(lt.rt, mn)
		new.rt = merge(new.rt, nrl)
	}
	return new
}

type segTree struct {
	n    int
	tree []*node
}

func newSegTree(n int) *segTree {
	t := &segTree{}
	t.n = 1
	for t.n < n {
		t.n *= 2
	}
	t.tree = make([]*node, t.n*2)
	for i := range t.tree {
		t.tree[i] = defaultNode
	}
	return t
}

func (t *segTree) maybeFree() {
	if almostFull() {
		reset()
		for _, n := range t.tree[1:] {
			markUsed(n.lt)
			markUsed(n.rt)
		}
	}
}

func (t *segTree) update(i, v int) {
	t.maybeFree()
	if v > 0 {
		t.tree[i+t.n] = newNode(empty, newTreapNode(v), false)
	} else {
		t.tree[i+t.n] = newNode(newTreapNode(-v), empty, false)
	}
	for i = (i + t.n) / 2; i > 0; i /= 2 {
		t.tree[i] = mergeNodes(t.tree[i*2], t.tree[i*2+1])
	}
}

func (t *segTree) query(i, j int) bool {
	t.maybeFree()
	lt, rt := defaultNode, defaultNode
	for i, j := i+t.n, j+t.n; i <= j; i, j = (i+1)/2, (j-1)/2 {
		if i%2 == 1 {
			lt = mergeNodes(lt, t.tree[i])
		}
		if j%2 == 0 {
			rt = mergeNodes(t.tree[j], rt)
		}
	}
	res := mergeNodes(lt, rt)
	return !res.bad && p[res.lt].sz == 0 && p[res.rt].sz == 0
}

// SegTree end

func init() {
	rand.Seed(time.Now().Unix())
	base := int64(rand.Intn(int(mod)-maxn) + maxn)
	bpow[0] = 1
	for i := 1; i < maxn; i++ {
		bpow[i] = bpow[i-1] * base % mod
	}
}

func main() {
	io := newFastIO(os.Stdin, os.Stdout)
	defer io.Flush()

	n, _ := io.nextInt(), io.nextInt()
	a := io.nextInts(n)

	st := newSegTree(n)
	for i := 0; i < n; i++ {
		st.update(i, a[i])
	}

	q := io.nextInt()
	for ; q > 0; q-- {
		typ := io.nextInt()
		if typ == 1 {
			i, t := io.nextInt()-1, io.nextInt()
			st.update(i, t)
		} else {
			l, r := io.nextInt()-1, io.nextInt()-1
			if st.query(l, r) {
				io.println("Yes")
			} else {
				io.println("No")
			}
		}
	}
}

type fastIO struct {
	*bufio.Reader
	*bufio.Writer
	p [1]byte
}

func newFastIO(r io.Reader, w io.Writer) *fastIO {
	return &fastIO{Reader: bufio.NewReader(r), Writer: bufio.NewWriter(w)}
}

func (f *fastIO) nextInt() int {
	f.Read(f.p[:])
	for f.p[0] <= ' ' {
		f.Read(f.p[:])
	}
	neg := false
	if f.p[0] == '-' {
		neg = true
		f.Read(f.p[:])
	}
	n := 0
	for '0' <= f.p[0] && f.p[0] <= '9' {
		n = n*10 + int(f.p[0]) - '0'
		f.Read(f.p[:])
	}
	if neg {
		return -n
	}
	return n
}

func (f *fastIO) nextInts(n int) []int {
	a := make([]int, n)
	for i := 0; i < n; i++ {
		a[i] = f.nextInt()
	}
	return a
}

func (f *fastIO) next() string {
	f.Read(f.p[:])
	for f.p[0] <= ' ' {
		f.Read(f.p[:])
	}
	var s []byte
	for f.p[0] > ' ' {
		s = append(s, f.p[0])
		f.Read(f.p[:])
	}
	return string(s)
}

func (f *fastIO) println(a ...interface{}) {
	fmt.Fprintln(f.Writer, a...)
}

func (f *fastIO) print(a ...interface{}) {
	fmt.Fprint(f.Writer, a...)
}

func (f *fastIO) printInts(a ...int) {
	if len(a) > 0 {
		f.print(a[0])
		for _, x := range a[1:] {
			f.print(" ", x)
		}
	}
}

func (f *fastIO) printlnInts(a ...int) {
	f.printInts(a...)
	f.println()
}

package main

import (
	"bufio"
	"fmt"
	"io"
	"math/rand"
	"os"
	"time"
)

const (
	mod    int64 = 1e9 + 9
	maxn   int   = 1e5 + 5
	poolSz int   = 9e6
)

var bpow [maxn]int64

// Treap begin

type trNode struct {
	val, hash  int
	prio       int
	lt, rt, sz int
}

const empty = 0

var (
	ptr = 0
	p   [poolSz]trNode
	st  [100]int
)

func newTreapNode(val int) int {
	ptr++
	p[ptr] = trNode{val, val, rand.Int(), empty, empty, 1}
	return ptr
}

func copyNode(i int) int {
	ptr++
	p[ptr] = p[i]
	return ptr
}

func update(i int) {
	if i == empty {
		return
	}
	lsz := p[p[i].lt].sz
	p[i].sz = lsz + 1 + p[p[i].rt].sz
	p[i].hash =
		int((int64(p[p[i].lt].hash) +
			int64(p[i].val)*bpow[lsz] +
			int64(p[p[i].rt].hash)*bpow[lsz+1]) % mod)
}

func merge(lt, rt int) (i int) {
	ii := &i
	ptr := len(st)
	for lt != empty && rt != empty {
		if p[lt].prio > p[rt].prio {
			*ii = copyNode(lt)
			ptr--
			st[ptr] = *ii
			ii = &p[*ii].rt
			lt = p[*ii].rt
		} else {
			*ii = copyNode(rt)
			ptr--
			st[ptr] = *ii
			ii = &p[*ii].lt
			rt = p[*ii].lt
		}
	}
	if lt == empty {
		*ii = rt
	} else {
		*ii = lt
	}
	for _, n := range st[ptr:] {
		update(n)
	}
	return
}

func split(i, pos int) (lt, rt int) {
	l, r := &lt, &rt
	ptr := len(st)
	for i != empty && 0 < pos && pos < p[i].sz {
		i = copyNode(i)
		ptr--
		st[ptr] = i
		lsz := p[p[i].lt].sz
		if pos <= lsz {
			*r = i
			i, r = p[i].lt, &p[i].lt
		} else {
			*l = i
			i, l = p[i].rt, &p[i].rt
			pos -= lsz + 1
		}
	}
	if i == empty {
		*l, *r = empty, empty
	} else if pos <= 0 {
		*l, *r = empty, i
	} else if pos >= p[i].sz {
		*l, *r = i, empty
	}
	for _, n := range st[ptr:] {
		update(n)
	}
	return
}

func prefixHash(i, r int) int64 {
	if i == empty {
		return 0
	}
	if r >= p[i].sz {
		return int64(p[i].hash)
	}
	res := prefixHash(p[i].lt, r)
	lsz := p[p[i].lt].sz
	if r > lsz {
		res = (res + int64(p[i].val)*bpow[lsz] +
			prefixHash(p[i].rt, r-lsz-1)*bpow[lsz+1]) % mod
	}
	return res
}

// Treap end

// SegTree begin

type node struct {
	lt, rt int
	bad    bool
}

var defaultNode = newNode(empty, empty, false)
var badNode = newNode(empty, empty, true)

func newNode(lt, rt int, bad bool) *node {
	return &node{lt, rt, bad}
}

func mergeNodes(lt, rt *node) *node {
	if lt.bad || rt.bad {
		return badNode
	}
	lrsz, rlsz := p[lt.rt].sz, p[rt.lt].sz
	mn := rlsz
	if lrsz < rlsz {
		mn = lrsz
	}
	lrhash := prefixHash(lt.rt, mn)
	rlhash := prefixHash(rt.lt, mn)
	if lrhash != rlhash {
		return badNode
	}
	new := newNode(lt.lt, rt.rt, false)
	if mn == lrsz {
		_, nlr := split(rt.lt, mn)
		new.lt = merge(new.lt, nlr)
	} else {
		_, nrl := split(lt.rt, mn)
		new.rt = merge(new.rt, nrl)
	}
	return new
}

type segTree struct {
	n    int
	tree []*node
}

func nodeForVal(v int) *node {
	if v > 0 {
		return newNode(empty, newTreapNode(v), false)
	}
	return newNode(newTreapNode(-v), empty, false)
}

func newSegTree(a []int) *segTree {
	t := &segTree{}
	t.n = 1
	for t.n < len(a) {
		t.n *= 2
	}
	t.tree = make([]*node, t.n*2)
	for i, v := range a {
		t.tree[i+t.n] = nodeForVal(v)
	}
	for i := len(a); i < t.n; i++ {
		t.tree[i+t.n] = defaultNode
	}
	for i := t.n - 1; i > 0; i-- {
		t.tree[i] = mergeNodes(t.tree[i*2], t.tree[i*2+1])
	}
	return t
}

func (t *segTree) update(i, v int) {
	t.tree[i+t.n] = nodeForVal(v)
	for i = (i + t.n) / 2; i > 0; i /= 2 {
		t.tree[i] = mergeNodes(t.tree[i*2], t.tree[i*2+1])
	}
}

func (t *segTree) query(i, j int) bool {
	lt, rt := defaultNode, defaultNode
	for i, j := i+t.n, j+t.n; i <= j; i, j = (i+1)/2, (j-1)/2 {
		if i%2 == 1 {
			lt = mergeNodes(lt, t.tree[i])
		}
		if j%2 == 0 {
			rt = mergeNodes(t.tree[j], rt)
		}
	}
	res := mergeNodes(lt, rt)
	return !res.bad && p[res.lt].sz == 0 && p[res.rt].sz == 0
}

// SegTree end

func init() {
	rand.Seed(time.Now().Unix())
	base := int64(rand.Intn(int(mod)-maxn) + maxn)
	bpow[0] = 1
	for i := 1; i < maxn; i++ {
		bpow[i] = bpow[i-1] * base % mod
	}
}

// Taking some cues from ecnerwala
// https://codeforces.com/contest/1340/submission/77861280

func main() {
	io := newFastIO(os.Stdin, os.Stdout)
	defer io.Flush()

	n, _ := io.nextInt(), io.nextInt()
	a := io.nextInts(n)

	ptrInitial := ptr
	st := newSegTree(a)

	for q := io.nextInt(); q > 0; q-- {
		if ptr+400 >= poolSz {
			ptr = ptrInitial
			st = newSegTree(a)
		}
		typ := io.nextInt()
		if typ == 1 {
			i, t := io.nextInt()-1, io.nextInt()
			a[i] = t
			st.update(i, t)
		} else {
			oldPtr := ptr
			l, r := io.nextInt()-1, io.nextInt()-1
			if st.query(l, r) {
				io.println("Yes")
			} else {
				io.println("No")
			}
			ptr = oldPtr
		}
	}
}

type fastIO struct {
	*bufio.Reader
	*bufio.Writer
	p [1]byte
}

func newFastIO(r io.Reader, w io.Writer) *fastIO {
	return &fastIO{Reader: bufio.NewReader(r), Writer: bufio.NewWriter(w)}
}

func (f *fastIO) nextInt() int {
	f.Read(f.p[:])
	for f.p[0] <= ' ' {
		f.Read(f.p[:])
	}
	neg := false
	if f.p[0] == '-' {
		neg = true
		f.Read(f.p[:])
	}
	n := 0
	for '0' <= f.p[0] && f.p[0] <= '9' {
		n = n*10 + int(f.p[0]) - '0'
		f.Read(f.p[:])
	}
	if neg {
		return -n
	}
	return n
}

func (f *fastIO) nextInts(n int) []int {
	a := make([]int, n)
	for i := 0; i < n; i++ {
		a[i] = f.nextInt()
	}
	return a
}

func (f *fastIO) println(a ...interface{}) {
	fmt.Fprintln(f.Writer, a...)
}