Problem:
Score : 100 points

Problem Statement

You are given an array a_0, a_1, ..., a_{N-1} of length N. Process Q queries of the following types.

The type of i-th query is represented by T_i.

T_i=1: You are given two integers X_i,V_i. Replace the value of A_{X_i} with V_i.

T_i=2: You are given two integers L_i,R_i. Calculate the maximum value among A_{L_i},A_{L_i+1},\cdots,A_{R_i}.

T_i=3: You are given two integers X_i,V_i. Calculate the minimum j such that X_i \leq j \leq N, V_i \leq A_j. If there is no such j, answer j=N+1 instead.

Constraints

1 \leq N \leq 2 \times 10^5

0 \leq A_i \leq 10^9

1 \leq Q \leq 2 \times 10^5

1 \leq T_i \leq 3

1 \leq X_i \leq N, 0 \leq V_i \leq 10^9 (T_i=1,3)

1 \leq L_i \leq R_i \leq N (T_i=2)

All values in Input are integer.

Input

Input is given from Standard Input in the following format:

N Q
A_1 A_2 \cdots A_N
First query
Second query
\vdots
Q-th query

Each query is given in the following format:

If T_i=1,3,

T_i X_i V_i

If T_i=2,

T_i L_i R_i

Output

For each query with T_i=2, 3, print the answer.

Sample Input 1

5 5
1 2 3 2 1
2 1 5
3 2 3
1 3 1
2 2 4
3 1 3

Sample Output 1

3
3
2
6

First query: Print 3, which is the maximum of (A_1,A_2,A_3,A_4,A_5)=(1,2,3,2,1).

Second query: Since 3>A_2, j=2 does not satisfy the condition．Since 3 \leq A_3, print j=3.

Third query: Replace the value of A_3 with 1. It becomes A=(1,2,1,2,1).

Fourth query: Print 2, which is the maximum of (A_2,A_3,A_4)=(2,1,2).

Fifth query: Since there is no j that satisfies the condition, print j=N+1=6.

Solution in C# (.NET Core 3.1.201) (judge verdict: Wrong Answer)

using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Globalization;
using System.IO;
using System.Text;
using System.Linq;

using E = System.Linq.Enumerable;
using System.Threading;

internal partial class Solver {
    public void Run() {
        var n = ni();
        var q = ni();
        var a = ni(n).ToList();

        var seg = new SegmentTree<int>((x, y) => Math.Max(x, y), int.MinValue);
        seg.Build(a);
        for (int i = 0; i < q; i++) {
            var t = ni();
            if (t == 1) {
                var x = ni() - 1;
                var v = ni();
                seg[x] = v;
            } else if (t == 2) {
                var l = ni() - 1;
                var r = ni() - 1;
                cout.WriteLine(seg.Query(l, r + 1));
            } else {
                var x = ni() - 1;
                var v = ni();

                //var p = MoveUntil(n, x - 1, j => v <= seg.Query(x, j + 1));
                var p = seg.MaxRight(x, y => y < v);
                if (p > n) p = n;
                cout.WriteLine(p + 1);
            }
        }
    }

    public static int MoveUntil(int ok, int ng, Predicate<int> predicate) {
        if (ok == ng) throw new Exception();
        while (Math.Abs(ok - ng) > 1) {
            var mid = (ok + ng) >> 1;
            if (predicate(mid)) {
                ok = mid;
            } else {
                ng = mid;
            }
        }
        return ok;
    }
}

public sealed class SegmentTree<TMonoid> {
    public int Count { get; private set; }
    private TMonoid[] _node;
    private readonly TMonoid _identity;
    private readonly Func<TMonoid, TMonoid, TMonoid> _merge;

    public SegmentTree(Func<TMonoid, TMonoid, TMonoid> merge, TMonoid identity) {
        _merge = merge;
        _identity = identity;
    }

    public void Build(IList<TMonoid> array) {
        Build(array.Count, i => array[i]);
    }

    public void Build(int n, Func<int, TMonoid> create) {
        Count = n;
        _node = new TMonoid[2 * Count];

        for (int i = 0; i < n; i++) {
            _node[i + Count] = create(i);
        }

        for (int i = Count - 1; i > 0; i--) {
            _node[i] = _merge(_node[i << 1], _node[i << 1 | 1]);
        }
    }

    public void Set(int index, TMonoid val) {
        int p = index + Count;
        _node[p] = val;
        while (p > 0) {
            p >>= 1;
            _node[p] = _merge(_node[p << 1], _node[p << 1 | 1]);
        }
    }

    public TMonoid Query(int begin, int end) {
        TMonoid lv = _identity, rv = _identity;
        int l = begin + Count;
        int r = end + Count - 1;
        for (; l <= r; l >>= 1, r >>= 1) {
            if ((l & 1) == 1) { lv = _merge(lv, _node[l++]); }
            if ((r & 1) == 0) { rv = _merge(_node[r--], rv); }
        }
        return _merge(lv, rv);
    }

    public int MaxRight(int l, Predicate<TMonoid> f) {
        if (l == Count) return Count;
        l += Count;
        var sm = _identity;
        var x = l;
        var set = new HashSet<int>();
        while (x > 0) {
            set.Add(x);
            x >>= 1;
        }
        do {
            while (l % 2 == 0) l >>= 1;
            if (!f(_merge(sm, _node[l]))) {
                while (l < Count) {
                    l = (2 * l);
                    if (f(_merge(sm, _node[l]))) {
                        sm = _merge(sm, _node[l]);
                        l++;
                    }
                }
                return l - Count;
            }
            sm = _merge(sm, _node[l]);
            l++;
        } while (!set.Contains(l));
        return Count;
    }
    public int MinLeft(int r, Predicate<TMonoid> f) {
        if (r == 0) return 0;
        r += Count;
        var sm = _identity;
        do {
            r--;
            while (r > 1 && (r % 2 != 0)) r >>= 1;
            if (!f(_merge(_node[r], sm))) {
                while (r < Count) {
                    r = (2 * r + 1);
                    if (f(_merge(_node[r], sm))) {
                        sm = _merge(_node[r], sm);
                        r--;
                    }
                }
                return r + 1 - Count;
            }
            sm = _merge(_node[r], sm);
        } while ((r & -r) != r);
        return 0;
    }

    public TMonoid this[int index] {
        get { return _node[index + Count]; }
        set { Set(index, value); }
    }
};
// PREWRITEN CODE BEGINS FROM HERE

static public class StringExtensions {
    static public string JoinToString<T>(this IEnumerable<T> source, string separator = " ") {
        return string.Join(separator, source);
    }
}

internal partial class Solver : Scanner {
    static readonly int? StackSizeInMebiByte = null; //50;
    public static void StartAndJoin(Action action, int maxStackSize) {
        var thread = new Thread(new ThreadStart(action), maxStackSize);
        thread.Start();
        thread.Join();
    }

    public static void Main() {
#if LOCAL
        byte[] inputBuffer = new byte[1000000];
        var inputStream = Console.OpenStandardInput(inputBuffer.Length);
        using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) {
            Console.SetIn(reader);
            new Solver(Console.In, Console.Out).Run();
        }
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        if (StackSizeInMebiByte.HasValue) {
            StartAndJoin(() => new Solver(Console.In, Console.Out).Run(), StackSizeInMebiByte.Value * 1024 * 1024);
        } else {
            new Solver(Console.In, Console.Out).Run();
        }
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
    private readonly TextWriter cerr;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
        cerr = Console.Error;
    }

    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

#if DEBUG
internal static class LinqPadExtension {
    public static string TextDump<T>(this T obj) {
        if (obj is IEnumerable) return (obj as IEnumerable).Cast<object>().JoinToString().Dump();
        else return obj.ToString().Dump();
    }
    public static T Dump<T>(this T obj) {
        return LINQPad.Extensions.Dump(obj);
    }
}
#endif

public class Scanner {
    private readonly TextReader Reader;
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    private readonly char[] buffer = new char[2 * 1024];
    private int cursor = 0, length = 0;
    private string Token;
    private readonly StringBuilder sb = new StringBuilder(1024);

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        Reader = reader;
    }

    public int NextInt() { return checked((int)NextLong()); }
    public long NextLong() {
        var s = Next();
        long r = 0;
        int i = 0;
        bool negative = false;
        if (s[i] == '-') {
            negative = true;
            i++;
        }
        for (; i < s.Length; i++) {
            r = r * 10 + (s[i] - '0');
#if DEBUG
            if (!char.IsDigit(s[i])) throw new FormatException();
#endif
        }
        return negative ? -r : r;
    }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        string[] array = new string[size];
        for (int i = 0; i < size; i++) {
            array[i] = Next();
        }

        return array;
    }
    public int[] NextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextInt();
        }

        return array;
    }

    public long[] NextLongArray(int size) {
        long[] array = new long[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextLong();
        }

        return array;
    }

    public double[] NextDoubleArray(int size) {
        double[] array = new double[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextDouble();
        }

        return array;
    }

    public string Next() {
        if (Token == null) {
            if (!StockToken()) {
                throw new Exception();
            }
        }
        var token = Token;
        Token = null;
        return token;
    }

    public bool HasNext() {
        if (Token != null) {
            return true;
        }

        return StockToken();
    }

    private bool StockToken() {
        while (true) {
            sb.Clear();
            while (true) {
                if (cursor >= length) {
                    cursor = 0;
                    if ((length = Reader.Read(buffer, 0, buffer.Length)) <= 0) {
                        break;
                    }
                }
                var c = buffer[cursor++];
                if (33 <= c && c <= 126) {
                    sb.Append(c);
                } else {
                    if (sb.Length > 0) break;
                }
            }

            if (sb.Length > 0) {
                Token = sb.ToString();
                return true;
            }

            return false;
        }
    }
}