Anagram Split

**This is an interactive task** Let's clear things up with some definitions: - Two binary strings $S$ and $T$ are *anagrams* of each other if it is possible to rearrange the letters in the string $S$ to get a string equal to $T$. - Let $S[l,r]$ be the substring of $S$ starting at $l$ and ending at $r$ both inclusive. - Let $f(S,l,r)$ be the frequency of character `1` in $S[l,r]$. Chef has two