<doocs>2217.Find Palindrome With Fixed Length_1.py
def kthPalindrome( queries: List[int], intLength: int) -> List[int]:
    l = (intLength + 1) >> 1
    start, end = 10 ** (l - 1), 10**l - 1
    ans = []
    for q in queries:
        v = start + q - 1
        if v > end:
            ans.append(-1)
            continue
        s = str(v)
        s += s[::-1][intLength % 2 :]
        ans.append(int(s))
    return ans
def sample_funcname ( var_0 : List [ int ] , var_3 : int ) -> List [ int ] :
    var_5 = ( var_3 + 1 ) >> 1
    var_7 , var_8 = 10 ** ( var_5 - 1 ) , 10 ** var_5 - 1
    var_9 = [ ]
    for var_10 in var_0 :
        var_11 = var_7 + var_10 - 1
        if var_11 > var_8 :
            var_9.append ( - 1 )
            continue
        var_14 = str ( var_11 )
        var_14 += var_14 [ : : - 1 ] [ var_3 % 2 : ]
        var_9.append ( int ( var_14 ) )
    return var_9
