we still need to precompute lcp-lr so it is able to tell us in o(1) time the lcp between any two entries of the suffix array. we know the standard lcp array gives us the lcp of consecutive entries only, i.e. lcp(i-1,i) for any i. however, m and m' in the description above are not necessarily consecutive entries.