the issue with using standard binary search (without the lcp information) is that in each of the o(log n) comparisons needed to be made, we compare p to the current entry of the suffix array, which means a full string comparison of up to m characters. so the complexity is o(m*log n).