#include using namespace std; #define ll long long int #define NO_OF_CHARS 256 void count(string &s, int len, int i, int j, int &counter) { while(i >= 0 && j < len && s[i] == s[j]) { i--; j++; counter++; } } ll longestPalindrome(string s) { int n = s.length(); int counter = 0; if (!n) return 0; if (n == 1) return 1; for (int i = 0;i>s; cin>>q; while(q--){ ll l,r; cin>>l>>r; k=s.substr(l-1,r); //cout<