Build a data structure that keeps track of a text $T$ (of length $n$) and a pattern $P$ (of length $m$) supporting 2 operations: - Update: performs a single-letter substitution in the pattern or the text. - Query(i): returns the Hamming distance between $P$ and $T[i:i+m]$, or reports that the distance exceeds $k$.