Coordinate Compression

You are given a sequence of integers $A_1, A_2, \dots, A_N$. For an integer $K$, let's define a *$K$-compressed* sequence $B_1, B_2, \dots, B_N$ as follows: - for each valid $i$, $B_i$ is a positive integer - for each valid $i$, if there are exactly $X$ numbers smaller than or equal to $A_i$ in the subsequence $A_{\mathop{max}(1, i-K)}, \dots, A_{\mathop{min}(N, i+K)}$, then there must be exactly