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

typedef struct {
    int dist, worker, bike;
} Pair;

int compare(const void* a, const void* b) {
    Pair* pa = (Pair*)a;
    Pair* pb = (Pair*)b;
    if (pa->dist != pb->dist) return pa->dist - pb->dist;
    if (pa->worker != pb->worker) return pa->worker - pb->worker;
    return pa->bike - pb->bike;
}

int* solution(int** workers, int workersSize, int** bikes, int bikesSize, int* returnSize) {
    *returnSize = workersSize;
    
    // Generate all pairs
    Pair* pairs = malloc(workersSize * bikesSize * sizeof(Pair));
    int pairCount = 0;
    
    for (int i = 0; i < workersSize; i++) {
        for (int j = 0; j < bikesSize; j++) {
            int dist = abs(workers[i][0] - bikes[j][0]) + abs(workers[i][1] - bikes[j][1]);
            pairs[pairCount++] = (Pair){dist, i, j};
        }
    }
    
    // Sort pairs
    qsort(pairs, pairCount, sizeof(Pair), compare);
    
    // Assign bikes
    int* result = malloc(workersSize * sizeof(int));
    int* usedBikes = calloc(bikesSize, sizeof(int));
    
    for (int i = 0; i < workersSize; i++) {
        result[i] = -1;
    }
    
    for (int i = 0; i < pairCount; i++) {
        int worker = pairs[i].worker;
        int bike = pairs[i].bike;
        
        if (result[worker] == -1 && !usedBikes[bike]) {
            result[worker] = bike;
            usedBikes[bike] = 1;
        }
    }
    
    free(pairs);
    free(usedBikes);
    return result;
}

int parseArray(char* line, int*** arr, int* size) {
    *size = 0;
    if (strlen(line) <= 2) return 0; // Empty array []
    
    // Count pairs by counting '[' after the first one
    for (int i = 1; i < strlen(line); i++) {
        if (line[i] == '[') (*size)++;
    }
    
    *arr = malloc(*size * sizeof(int*));
    for (int i = 0; i < *size; i++) {
        (*arr)[i] = malloc(2 * sizeof(int));
    }
    
    int idx = 0;
    char* ptr = line + 1; // Skip first '['
    
    while (idx < *size && *ptr) {
        while (*ptr && *ptr != '[') ptr++; // Find next '['
        if (!*ptr) break;
        ptr++; // Skip '['
        
        // Parse first number
        (*arr)[idx][0] = strtol(ptr, &ptr, 10);
        while (*ptr && *ptr != ',') ptr++; // Skip to ','
        if (*ptr == ',') ptr++; // Skip ','
        
        // Parse second number  
        (*arr)[idx][1] = strtol(ptr, &ptr, 10);
        while (*ptr && *ptr != ']') ptr++; // Skip to ']'
        if (*ptr == ']') ptr++; // Skip ']'
        
        idx++;
    }
    
    return *size;
}

int main() {
    char line[10000];
    
    // Read workers
    fgets(line, sizeof(line), stdin);
    line[strcspn(line, "\n")] = 0; // Remove newline
    
    int** workers;
    int workersSize;
    parseArray(line, &workers, &workersSize);
    
    // Read bikes
    fgets(line, sizeof(line), stdin);
    line[strcspn(line, "\n")] = 0; // Remove newline
    
    int** bikes;
    int bikesSize;
    parseArray(line, &bikes, &bikesSize);
    
    int returnSize;
    int* result = solution(workers, workersSize, bikes, bikesSize, &returnSize);
    
    printf("[");
    for (int i = 0; i < returnSize; i++) {
        if (i > 0) printf(",");
        printf("%d", result[i]);
    }
    printf("]\n");
    
    // Free memory
    for (int i = 0; i < workersSize; i++) {
        free(workers[i]);
    }
    free(workers);
    
    for (int i = 0; i < bikesSize; i++) {
        free(bikes[i]);
    }
    free(bikes);
    
    free(result);
    
    return 0;
}