Palindrome Partitioning III

Given a string s and an integer k, partition s into k non-empty disjoint substrings such that each substring is a palindrome. Return the minimum number of characters that you need to change to make all the k substrings the same.