	At any point during the binary search algorithm, we consider, as usual, a range (L...,R) of the suffix array and its central point M, and decide whether we continue our search in the left sub-range (L...,M) or in the right sub-range (M...,R). In order to make the decision, we compare P to the string at M. If P is identical to M, search is complete. But if not, we have already compared the first k characters of P and then decided whether P is lexicographically smaller or larger than M. Let's assume the outcome is that P is larger than M. So, in the next step, we consider (M...,R) and a new central point M' in the middle: