What is the worst time complexity of knuth-morris-pratt pattern matching algorithm

I am confused between O(n) and O(n+m).