Palindromes and Queries

You are given a string $S$. Let the set of strings $ST$ be the set of all distinct contiguous [palindromic](https://en.wikipedia.org/wiki/Palindrome) substrings of $S$. Each element of $ST$ has a `value` associated with it which is initially 0. You need to process $Q$ queries which are of the following two types: - $1$ $L$ $R$ $P$ $X$: Add $X$ to the values of all palindromes that are substri