Problem: Valery is a PE teacher at a school in Berland. Soon the students are going to take a test in long jumps, and Valery has lost his favorite ruler! 

However, there is no reason for disappointment, as Valery has found another ruler, its length is l centimeters. The ruler already has n marks, with which he can make measurements. We assume that the marks are numbered from 1 to n in the order they appear from the beginning of the ruler to its end. The first point coincides with the beginning of the ruler and represents the origin. The last mark coincides with the end of the ruler, at distance l from the origin. This ruler can be repesented by an increasing sequence a1, a2, ..., an, where ai denotes the distance of the i-th mark from the origin (a1 = 0, an = l).

Valery believes that with a ruler he can measure the distance of d centimeters, if there is a pair of integers i and j (1 ≤ i ≤ j ≤ n), such that the distance between the i-th and the j-th mark is exactly equal to d (in other words, aj - ai = d). 

Under the rules, the girls should be able to jump at least x centimeters, and the boys should be able to jump at least y (x < y) centimeters. To test the children's abilities, Valery needs a ruler to measure each of the distances x and y. 

Your task is to determine what is the minimum number of additional marks you need to add on the ruler so that they can be used to measure the distances x and y. Valery can add the marks at any integer non-negative distance from the origin not exceeding the length of the ruler.

Input

The first line contains four positive space-separated integers n, l, x, y (2 ≤ n ≤ 105, 2 ≤ l ≤ 109, 1 ≤ x < y ≤ l) — the number of marks, the length of the ruler and the jump norms for girls and boys, correspondingly.

The second line contains a sequence of n integers a1, a2, ..., an (0 = a1 < a2 < ... < an = l), where ai shows the distance from the i-th mark to the origin.

Output

In the first line print a single non-negative integer v — the minimum number of marks that you need to add on the ruler.

In the second line print v space-separated integers p1, p2, ..., pv (0 ≤ pi ≤ l). Number pi means that the i-th mark should be at the distance of pi centimeters from the origin. Print the marks in any order. If there are multiple solutions, print any of them.

Examples

Input

3 250 185 230
0 185 250


Output

1
230


Input

4 250 185 230
0 20 185 250


Output

0


Input

2 300 185 230
0 300


Output

2
185 230

Note

In the first sample it is impossible to initially measure the distance of 230 centimeters. For that it is enough to add a 20 centimeter mark or a 230 centimeter mark.

In the second sample you already can use the ruler to measure the distances of 185 and 230 centimeters, so you don't have to add new marks.

In the third sample the ruler only contains the initial and the final marks. We will need to add two marks to be able to test the children's skills.

Solution (in JAVA):

Solution:
import java.util.Arrays;
import java.util.Scanner;

/*
 * Codeforces Round #274 (Div. 2)
 * http://codeforces.ru/contest/478
 */

public class Main {
	public static void main(String[] args) {
		D();
	}

	public static void A() {
		int a = IO.readInt();
		int b = IO.readInt();
		int c = IO.readInt();
		
		int max = a + b + c;
		if (a + b * c > max) {
			max = a + b * c;
		}
		if (a * b + c > max) {
			max = a * b + c;
		}
		if (a * b * c > max) {
			max = a * b * c;
		}
		if ((a + b) * c > max) {
			max = (a + b) * c;
		}
		if (a * (b + c) > max) {
			max = a * (b + c);
		}
		
		IO.println(max);
	}
	
	public static void B() {
		int n = IO.readInt();
		int k = IO.readInt();
		
		Castle[] a1 = new Castle[n];
		Castle[] a2 = new Castle[n];
		
		for (int index = 0; index < n; ++index) {
			a1[index] = new Castle();
			a1[index].i = index + 1;
			a1[index].n = IO.readInt();
		}
		
		Arrays.sort(a1);
		
		for (int index = 0; index < n; ++index) {
			a2[index] = new Castle();
			a2[index].i = a1[index].i;
			a2[index].n = a1[index].n;
		}
		
		int d = a1[n - 1].n - a1[0].n;
		int l = k;
		int minStep = 0;
		while (d > 0 && l > 0) {
			if (a1[n - 1].n - 1 < a1[0].n + 1) {
				break;
			}
			
			a1[n - 1].n--;
			a1[0].n++;
			
			l--;
			
			Arrays.sort(a1);
			
			int newD = a1[n - 1].n - a1[0].n;
			if (newD < d) {
				d = newD;
				minStep = k - l;
			}
		}
		
		IO.println(d + " " + minStep);
		
		while (minStep > 0) {
			if (a2[n - 1].n - 1 < a2[0].n + 1) {
				break;
			}
			
			IO.println(a2[n - 1].i + " " + a2[0].i);
			
			a2[n - 1].n--;
			a2[0].n++;
			
			minStep--;
			
			Arrays.sort(a2);
		}
	}
	
	private static class Castle implements Comparable<Castle>{
		private int n;
		private int i;
		
		@Override
		public int compareTo(Castle o) {
			return Integer.compare(n, o.n);
		}
	}
	
	private static void swap(Castle[] a, int i, int j) {
		Castle temp = a[j];
		a[j] = a[i];
		a[i] = temp;
	}
	
	public static void C() {
		int n = IO.readInt();
		
		Exam[] a = new Exam[n];
		for (int index = 0; index < n; ++index) {
			a[index] = new Exam();
			a[index].a = IO.readInt();
			a[index].b = IO.readInt();
		}
		
		Arrays.sort(a);
		
		int minGroup = -1;
		int minPrevGroup = -1;
		
		for (int index = 0; index < n; ++index) {
			if (index > 0 && a[index].a != a[index - 1].a) {
				minPrevGroup = minGroup;
				minGroup = -1;
			}
			
			if (a[index].b < minPrevGroup) {
				minGroup = a[index].a;
			}
			else if (a[index].b > minGroup){
				minGroup = a[index].b;
			}
		}
		
		IO.println(minGroup);
	}
	
	private static class Exam implements Comparable<Exam>{
		int a;
		int b;
		
		@Override
		public int compareTo(Exam o) {
			return Integer.compare(a, o.a);
		}
		
		
	}
	
	public static void D() {
		int n = IO.readInt();
		int l = IO.readInt();
		int y = IO.readInt();
		int x = IO.readInt();
		
		int[] a = new int[n];
		for (int i = 0; i < n; ++i) {
			a[i] = IO.readInt();
		}
		
		int measureX = find(a, x);
		int measureY = find(a, y);
		
		if (measureX > -1 && measureY > -1) {
			IO.println(0);
			return;
		}
		else if (measureX > -1) {
			IO.println(1);
			IO.println(y);
			return;
		} 
		else if (measureY > -1) {
			IO.println(1);
			IO.println(x);
			return;
		}
		
		int measure = find(a, x - y, y);
		if (measure > -1) { 
			IO.println(1);
			if (measure >= y) {
				IO.println(measure - y);
			}
			else {
				IO.println(measure + x);
			}
			return;
		}
		
		measure = find(a, x + y);
		if (measure > -1) { 
			IO.println(1);
			IO.println(measure + y);
			return;
		}
		
		IO.println(2);
		IO.println(y + " " + x);
	}

	private static int find(int[] a, int x) {
		int i = 0;
		int j = 1;
		while (true) {
			int d = a[j] - a[i];
			if (d == x) {
				return a[i];
			}
			else if (d > x){
				if (i + 1 < j) {
					i++;
				}
				else if (j < a.length - 1) {
					j++;
				}
				else {
					break;
				}
			}
			else {
				if (j < a.length - 1) {
					j++;
				}
				else {
					break;
				}
			}
			
		}
		
		return -1;
	}
	
	private static int find(int[] a, int x, int margin) {
		int i = 0;
		int j = 1;
		while (true) {
			int d = a[j] - a[i];
			if (d == x && (a[i] >= margin || (a[a.length - 1] - a[j]) >= margin)) {
				return a[i];
			}
			else if (d > x){
				if (i + 1 < j) {
					i++;
				}
				else if (j < a.length - 1) {
					j++;
				}
				else {
					break;
				}
			}
			else {
				if (j < a.length - 1) {
					j++;
				}
				else {
					break;
				}
			}
			
		}
		
		return -1;
	}
	
	public static void E() {
		
	}
	
	
	
	//************* Input/Output *************//
	
	private static class IO {
		static {
			setUpScanner();
		}

		private static Scanner scanner;

		private static void setUpScanner() {
			scanner = new Scanner(new java.io.BufferedInputStream(System.in));
		};

		public static boolean isEmpty() {
			return !scanner.hasNext();
		}

		public static boolean hasNextLine() {
			return scanner.hasNextLine();
		}

		public static String readLine() {
			String line;
			try {
				line = scanner.nextLine();
			} catch (Exception e) {
				line = null;
			}
			return line;
		}

		public static String readString() {
			return scanner.next();
		}

		public static int readInt() {
			return scanner.nextInt();
		}

		public static double readDouble() {
			return scanner.nextDouble();
		}

		public static float readFloat() {
			return scanner.nextFloat();
		}

		public static long readLong() {
			return scanner.nextLong();
		}

		public static void print(Object o) {
			System.out.print(o.toString());
		}

		public static void println(Object o) {
			System.out.println(o);
		}
	}

	
	
	//************* Algorithms *************//
	
	private static class Algo {
		
		public static int binSearch(int[] array, int n, int lo, int hi) {
			if (lo > hi) {
				return lo;
			}
			
			int mid = lo + (hi - lo) /2;
			int cmp = (int) Math.signum(n - array[mid]);
			if (cmp < 0) {
				return binSearch(array, n, lo, mid - 1);
			}
			else if (cmp == 0) {
				return mid;
			}
			else {
				return binSearch(array, n, mid + 1, hi);
			}
		}
		
	}
}