Given a string s and an array queries where each query is [left, right, k], determine for each query whether you can rearrange the substring s[left..right] (inclusive) into a palindrome by changing at most k characters.

Changing a character means replacing it with any other lowercase English letter. Rearranging the substring is free and does not count as a change.