	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).