from collections import Counter
def can_construct_palindrome(s, k):
 # Count the frequency of each character in the string
 char_count = Counter(s)
 
 # Count the number of characters with odd frequency
 odd_count = sum(count % 2 for count in char_count.values())
 
 # If k is greater than or equal to the number of odd-count characters,
 # it's possible to construct k palindromic strings
 return k >= odd_count and k <= len(s)