function primepairs(input) {
    let firstPair = Number(input.shift());
    let secondPair = Number(input.shift());
    let firstDiff = Number(input.shift());
    let secondDiff = Number(input.shift());
    let endFirst = firstPair + firstDiff;
    let endSecond = secondPair + secondDiff;
    for (let i = firstPair; i <= endFirst; i++) {
        for (let j = secondPair; j <= endSecond; j++) {
            let isFirstPrime = true;
            let isSecondPrime = true;
            for (let k = 2; k <= Math.sqrt(i); k++) {
                if (i % k == 0) {
                    isFirstPrime = false;
                    break;
                }
            }
            for (let k = 2; k <= Math.sqrt(j); k++) {
                if (j % k == 0) {
                    isSecondPrime = false;
                    break;
                }
            }
            if (isFirstPrime && isSecondPrime) {
                console.log(`${i}${j}`)

            }

        }

    }

}