chunk, </span>
<span class="c1">#                 [0] </span>
<span class="c1">#               + [k for k, v in sorted(dict(enumerate(order, 1)).items(),key=lambda x: x[1])] </span>
<span class="c1">#               + [mid_len-1])</span>

        <span class="c1"># V3: just return whole seq of char indices as input and output.</span>
        <span class="c1"># Prob more computationally expensive (seq2seq vs multiclass classification)</span>
        <span class="k">return</span> <span class="bp">self</span><s