namespace AtCoder; #nullable enable using System.Numerics; class SegmentTree { public static SegmentTree Build(TMonoid[] initial, TOperator op) where TOperator : struct, ISegmentTreeOperator => new(initial, op); } interface ISegmentTreeOperator { TMonoid IdentityElement { get; } TMonoid Operation(TMonoid x, TMonoid y); } partial class SegmentTree where TOperator : struct, ISegmentTreeOperator { public int BaseSize { get; init; } protected int Height { get; init; } protected TOperator Op { get; init; } protected TMonoid[] Values { get; init; } public SegmentTree(TMonoid[] initial, TOperator op = default) { Op = op; (BaseSize, Height) = (1, 0); while (BaseSize < initial.Length) (BaseSize, Height) = (BaseSize << 1, Height + 1); var size = BaseSize << 1; Values = new TMonoid[size]; var values = Values.AsSpan(); for (var i = 0; i < size; i++) values[i] = op.IdentityElement; for (var i = 0; i < initial.Length; i++) values[i + BaseSize] = initial[i]; for (var i = BaseSize - 1; i > 0; i--) Update(values, i); } public TMonoid Product(int l, int r) { (l, r) = (l + BaseSize, r + BaseSize); var (resL, resR) = (Op.IdentityElement, Op.IdentityElement); var values = Values.AsSpan(); while (l < r) { if ((l & 1) == 1) resL = Op.Operation(resL, values[l++]); if ((r & 1) == 1) resR = Op.Operation(values[--r], resR); (l, r) = (l >> 1, r >> 1); } return Op.Operation(resL, resR); } public void Set(int index, TMonoid value) { var j = index + BaseSize; var values = Values.AsSpan(); values[j] = value; for (var i = 1; i <= Height; i++) Update(values, j >> i); } protected void Update(Span values, int k) { values[k] = Op.Operation(values[k << 1], values[(k << 1) + 1]); } } readonly struct SumOp : ISegmentTreeOperator where TNumber : INumber { public TNumber IdentityElement => TNumber.Zero; public TNumber Operation(TNumber x, TNumber y) => x + y; } static class Extensions { public static T[] Repeat(this int time, Func F) => Enumerable.Range(0, time).Select(_ => F()).ToArray(); } class AtCoder { object? Solve() { var n = Int(); var q = Int(); var l = Int(); var az = n.Repeat(Int); var queries = new (int, int, int)[q]; var max = l; for (var i = 0; i < q; i++) { var k = Int(); var v1 = Int(); if (k == 2) queries[i].Item3 = Int(); if (k == 3) max = v1; queries[i].Item1 = k; queries[i].Item2 = v1; } max = Math.Max(max, az.Max()); var ans = new List<(long, long)>(); var a1 = new long[max + 1]; var a2 = new long[max + 1]; for (var i = 0; i < n; i++) { var a = az[i]; a1[a] += 1; a2[a] += a; } var op = new SumOp(); var t1 = SegmentTree.Build(a1, op); var t2 = SegmentTree.Build(a2, op); foreach (var (k, x, y) in queries) { if (k == 1) { t1.Set(x, t1.Product(x, x + 1) + 1); t2.Set(x, t2.Product(x, x + 1) + x); } if (k == 2) { var v1 = t1.Product(x, y + 1); var v2 = t2.Product(x, y + 1); ans.Add((v1, v2)); } } if (ans.Count == 0) return "Not Found!"; else foreach (var (x, y) in ans) Out(new[]{ x, y }, " "); return null; } public static void Main() => new AtCoder().Run(); public void Run() { var res = Solve(); if (res != null) { if (res is bool yes) res = yes ? "Yes" : "No"; sw.WriteLine(res); } sw.Flush(); } string[] input = Array.Empty(); int iter = 0; readonly StreamWriter sw = new(Console.OpenStandardOutput()) { AutoFlush = false }; string String() { while (iter >= input.Length) (input, iter) = (Console.ReadLine()!.Trim().Split(' '), 0); return input[iter++]; } T Input() where T : IParsable => T.Parse(String(), null); int Int() => Input(); void Out(object? x, string? separator = null) { separator ??= Environment.NewLine; if (x is System.Collections.IEnumerable obj and not string) { var firstLine = true; foreach (var item in obj) { if (!firstLine) sw.Write(separator); firstLine = false; sw.Write(item); } } else sw.Write(x); sw.WriteLine(); } }