First non-Palindrome

For the given string S of length N you need to find for each L from 1 to N the first non-palindrome substring of S that has length L. That is, for each L from 1 to N you need to find the smallest positive integer K such that the string S[K, K + L - 1] is not a palindrome. Denote this number by K(L). Here S[i, j] stands for the substring of S composed of its characters in positions i, i + 1, ..., j