Given a text $T$ of length $n$ and a pattern $P$ of length $m$, both consisting of numbers, output the normalised Hamming distance under shifts ($d_H^+(i) = \min_{\alpha} \left| \{ j \mid \alpha+P[j] \neq T[i+j] \} \right|$) at every position $i\in \{0, \dots, n-m\}$ of the text.