Find Palindrome With Fixed Length

Given an integer array named queries and a positive integer named intLength, the task is to print an space separated array named answer where answer[i] is either the queries[i]th smallest positive palindrome of length intLength, or -1 if no such palindrome exists.