package arborideintervale;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.Writer;
import java.util.ArrayList;

class Operation {
	int type;
	int a;
	int b;
	
	public Operation(int type, int a, int b) {
		this.type = type;
		this.a = a;
		this.b = b;
	}
	
	@Override
	public String toString() {
		// TODO Auto-generated method stub
		return "(" + this.type + " " + this.a + " " + this.b + ")";
	}
}

public class Main {
	
	public static void solveForOperations(ArrayList<Integer> numbers, ArrayList<Operation> operations) throws IOException {
		Writer wr = new FileWriter("arbint.out");
		
		for (Operation op : operations) {
			if (op.type == 1) {
//				numbers.set(op.a - 1, op.b);
			} else {
//				int max = Integer.MIN_VALUE;
//				
//				for (int i = op.a - 1; i < op.b; i++) {
//					if (max < numbers.get(i)) {
//						max = numbers.get(i);
//					}
//				}
//				
//				wr.write(Integer.toString(max));
//				wr.write("\n");
			}
		}
		
		wr.close();
	}
	
	public static void main(String[] args) throws IOException{
		File file = new File("arbint.in");
		BufferedReader reader = null;
		ArrayList<Integer> numbers = new ArrayList<Integer>();
		ArrayList<Operation> operations = new ArrayList<Operation>();
		
		reader = new BufferedReader(new FileReader(file));
		
		String[] s = reader.readLine().split(" ");

		int n = Integer.parseInt(s[0]);
		int m = Integer.parseInt(s[1]);
		
		s = reader.readLine().split(" ");
		
		for (String x : s) {
			numbers.add(Integer.parseInt(x));
		}
		
		for (int i = 0; i < m; i++) {
			s = reader.readLine().split(" ");
			
			operations.add(new Operation(Integer.parseInt(s[0]), Integer.parseInt(s[1]), Integer.parseInt(s[2])));
		}
		
//		System.out.println(numbers);
//		System.out.println(operations);
		solveForOperations(numbers, operations);
	}
}