Sort Them

You are given a string $S$ of length $N$ that contains only lowercase English letters. You are also given a string $P$ of length $26$, that contains every lowercase English letter exactly once. You can perform the following operation: - Choose an index $i$ ($1 \leq i \leq N$). - Let $x = 27 - \text{ord}_P(S_i)$. - Here, $\text{ord}_P(S_i)$ denotes the (unique) position of character $S_i$ in