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

int compare(const void* a, const void* b) {
    return (*(int*)a - *(int*)b);
}

bool solution(int* nums, int numsSize, int indexDiff, int valueDiff) {
    if (indexDiff <= 0 || valueDiff < 0) return false;
    
    int window[1000];
    int windowSize = 0;
    
    for (int i = 0; i < numsSize; i++) {
        // Remove element outside window
        if (i > indexDiff) {
            int toRemove = nums[i - indexDiff - 1];
            for (int j = 0; j < windowSize; j++) {
                if (window[j] == toRemove) {
                    for (int k = j; k < windowSize - 1; k++) {
                        window[k] = window[k + 1];
                    }
                    windowSize--;
                    break;
                }
            }
        }
        
        // Check if there's any element in range [num-valueDiff, num+valueDiff]
        int num = nums[i];
        int leftBound = num - valueDiff;
        int rightBound = num + valueDiff;
        
        for (int j = 0; j < windowSize; j++) {
            if (window[j] >= leftBound && window[j] <= rightBound) {
                return true;
            }
        }
        
        // Insert in sorted order
        window[windowSize++] = num;
        qsort(window, windowSize, sizeof(int), compare);
    }
    
    return false;
}

int main() {
    char line[10000];
    fgets(line, sizeof(line), stdin);
    
    // Parse array
    int nums[1000];
    int numsSize = 0;
    char* token = strtok(line, "[],\n");
    while (token != NULL) {
        nums[numsSize++] = atoi(token);
        token = strtok(NULL, "[],\n");
    }
    
    int indexDiff, valueDiff;
    scanf("%d", &indexDiff);
    scanf("%d", &valueDiff);
    
    bool result = solution(nums, numsSize, indexDiff, valueDiff);
    printf(result ? "true\n" : "false\n");
    return 0;
}