Before revision:  Previously, an O(n^3 log n)-time algorithm was given for the problem but only for the special case m=1.
After revision:  Previously, an O(n^3 \log n)-time algorithm was given for the problem but only for the special case m=1.