Palindrome Queries

You are given a string that consists of n characters between a–z. The positions of the string are indexed 1,2,\dots,n. Your task is to process m operations of the following types: - Change the character at position k to x - Check if the substring from position a to position b is a palindrome Input The first input line has two integers n and m: the length of the string and the number of operat