#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>

long long calculatePalindrome(int pos, int length) {
    if (length == 1) {
        return pos <= 9 ? pos : -1;
    }
    
    int half = (length + 1) / 2;
    long long totalPalindromes = 9LL * (long long)pow(10, half - 1);
    
    if (pos > totalPalindromes) {
        return -1;
    }
    
    long long start = (long long)pow(10, half - 1);
    long long firstHalf = start + pos - 1;
    
    char s[20];
    sprintf(s, "%lld", firstHalf);
    
    char palindrome[50];
    strcpy(palindrome, s);
    
    int len = strlen(s);
    if (length % 2 == 0) {
        for (int i = len - 1; i >= 0; i--) {
            palindrome[len + (len - 1 - i)] = s[i];
        }
        palindrome[length] = '\0';
    } else {
        for (int i = len - 2; i >= 0; i--) {
            palindrome[len + (len - 2 - i)] = s[i];
        }
        palindrome[length] = '\0';
    }
    
    return atoll(palindrome);
}

long long* solution(int* queries, int queriesSize, int intLength, int* returnSize) {
    *returnSize = queriesSize;
    long long* result = (long long*)malloc(queriesSize * sizeof(long long));
    
    for (int i = 0; i < queriesSize; i++) {
        result[i] = calculatePalindrome(queries[i], intLength);
    }
    
    return result;
}

int main() {
    char line[1000];
    fgets(line, sizeof(line), stdin);
    
    int queries[100];
    int queriesSize = 0;
    char* token = strtok(line + 1, ",]");
    while (token != NULL) {
        queries[queriesSize++] = atoi(token);
        token = strtok(NULL, ",]");
    }
    
    int intLength;
    scanf("%d", &intLength);
    
    int returnSize;
    long long* result = solution(queries, queriesSize, intLength, &returnSize);
    
    printf("[");
    for (int i = 0; i < returnSize; i++) {
        printf("%lld", result[i]);
        if (i < returnSize - 1) printf(",");
    }
    printf("]\n");
    
    free(result);
    return 0;
}