function solve(args) {
	return function getPrimes(x, y) {
		if (arguments.length < 2) {
		throw 'Error';
	} else if (isNaN(arguments[0]) || isNaN(arguments[1])) {
		throw 'Error';
	}
		let from = +x,
			to = +y,
			divisor,
			maxDivisor,
			primes = [],
			isPrime;
		for (i = from; i <= to; i += 1) {
			maxDivisor = Math.sqrt(i);
			isPrime = true;
			for (divisor = 2; divisor <= maxDivisor; divisor += 1) {
				if (i % divisor === 0) {
					isPrime = false;
					break;
				}
			}
			if (isPrime && i > 1) {
				primes.push(i);
			}
		}
		return primes;
	};
}