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.*;
import java.io.*;
import java.math.*;
public class CFD479 {
public static void main(String args[]) {
	InputReader in = new InputReader(System.in);
	//OutputStream outputStream = System.out;
	PrintWriter out = new PrintWriter(System.out);
	int n=in.nextInt();
	int l=in.nextInt();
	int x=in.nextInt();
	int y=in.nextInt();
	int ar[]=new int[n];
	HashSet<Integer>hs=new HashSet<>();
	for(int i=0;i<n;i++)
	{
		ar[i]=in.nextInt();
		hs.add(ar[i]);
	}
	int a=-1;int b=-1;int c=-1;
	int diff1=x+y;
	int diff2=y-x;
	boolean arr[]=new boolean[4];
	for(int i=0;i<4;i++)
		arr[i]=false;
	for(int i=0;i<n;i++){
		int z1=ar[i]+x;
		int z2=ar[i]-x;
		int zz1=ar[i]+y;
		int zz2=ar[i]-y;
		int zzz1=ar[i]-diff1;
		int zzz2=ar[i]+diff1;
		int zzzz1=ar[i]-diff2;
		int zzzz2=ar[i]+diff2;
		
		if(hs.contains(z1)||hs.contains(z2))
			arr[0]=true;
		if(hs.contains(zz1)||hs.contains(zz2))
			arr[1]=true;
		if(hs.contains(zzz1)||hs.contains(zzz2)){
			arr[2]=true;
			if(hs.contains(zzz1)){
				a=zzz1;
				b=0;
			}
			else{
				a=zzz2;
				b=1;
			}
		}
		if(hs.contains(zzzz1)||hs.contains(zzzz2)){
			//out.println("xxxxxxxxxxxxxxxxxxxxxxxx"+zzzz1+" "+zzzz2+" "+diff2);
			if(hs.contains(zzzz1)&&(zzzz1+y)<=l)
			{
				//out.print("xxxxX"+zzzz1);
				arr[3]=true;
				a=zzzz1+y;
			}
			else if(hs.contains(zzzz1)&&(zzzz1-x)>=0){
				//out.print("xxxxX"+zzzz1);
				arr[3]=true;
				a=zzzz1-x;
			}
			else if(hs.contains(zzzz2)&&(zzzz2-y)>=0)
			{
				//out.print("xxxxX"+zzzz2);
				arr[3]=true;
				a=zzzz2-y;
			}
			else if(hs.contains(zzzz2)&&(zzzz2+x)<=l)
			{
				//out.print("xxxxX"+zzzz2);
				arr[3]=true;
				a=zzzz2+x;
			}
		}
		
	}
	if(arr[0]==true&&arr[1]==true)
	{
		out.println(0);
	}
	else if(arr[0]==true&&arr[1]==false)
	{
		out.println(1);
		out.println(y);
	}
	else if(arr[0]==false&&arr[1]==true)
	{
		out.println(1);
		out.println(x);
	}
	else if(arr[2]==true)
	{
		out.println(1);
		if(b==0){
			out.println(a+x);
		}
		else
			out.println(a-x);
	}
	else if(arr[3]==true)
	{
		out.println(1);
		out.println(a);
	}
	else{
		out.println(2);
		out.println(x+" "+y);
	}
	out.close();

}

int sieveOfEratosthenes(int n) {
	// Create a boolean array "prime[0..n]" and initialize
	// all entries it as true. A value in prime[i] will
	// finally be false if i is Not a prime, else true.
	boolean prime[] = new boolean[n + 1];
	for (int i = 0; i < n; i++)
		prime[i] = true;

	for (int p = 2; p * p <= n; p++) {
		// If prime[p] is not changed, then it is a prime
		if (prime[p] == true) {
			// Update all multiples of p
			for (int i = p * 2; i <= n; i += p)
				prime[i] = false;
		}
	}
	int c = 0;
	for (int i = 2; i <= n; i++) {
		if (prime[i] == true)
			c++;
	}
	return c;
	// Print all prime numbers
	/* for(int i = 2; i <= n; i++)
	 {
	     if(prime[i] == true)
	         System.out.print(i + " ");
	 }*/
}

static class Pair implements Comparable<Pair> {
	int u;
	int v;
	BigInteger bi;

	public Pair(int u, int v) {
		this.u = u;
		this.v = v;
	}

	public int hashCode() {
		int hu = (int) (u ^ (u >>> 32));
		int hv = (int) (v ^ (v >>> 32));
		return 31 * hu + hv;
	}

	public boolean equals(Object o) {
		Pair other = (Pair) o;
		return u == other.u && v == other.v;
	}

	public int compareTo(Pair other) {
		return Long.compare(u, other.u) != 0 ? Long.compare(u, other.u) : Long.compare(v, other.v);
	}

	public String toString() {
		return "[u=" + u + ", v=" + v + "]";
	}
}

static long modulo(long a, long b, long c) {
	long x = 1;
	long y = a;
	while (b > 0) {
		if (b % 2 == 1) {
			x = (x * y) % c;
		}
		y = (y * y) % c; // squaring the base
		b /= 2;
	}
	return x % c;
}

public static long getClosestK(long[] a, long x) {

	int low = 0;
	int high = a.length - 1;

	while (low <= high) {
		int mid = (low + high) / 2;

		// test lower case
		if (mid == 0) {
			if (a.length == 1) {
				return a[0];
			}

			return Math.min(Math.abs(a[0] - x), Math.abs(a[1] - x)) + x;
		}

		// test upper case
		if (mid == a.length - 1) {
			return a[a.length - 1];
		}

		// test equality
		if (a[mid] == x || a[mid + 1] == x) {
			return x;
		}

		// test perfect range.
		if (a[mid] < x && a[mid + 1] > x) {
			return Math.min(Math.abs(a[mid] - x), Math.abs(a[mid + 1] - x)) + x;
		}

		// keep searching.
		if (a[mid] < x) {
			low = mid + 1;
		} else {
			high = mid;
		}
	}

	throw new IllegalArgumentException("The array cannot be empty");
}

long factorial(long n, long M) {
	long ans = 1;
	while (n >= 1) {
		ans = (ans * n) % M;
		n--;
	}
	return ans;
}

static long gcd(long x, long y) {
	if (x == 0)
		return y;
	if (y == 0)
		return x;
	long r = 0, a, b;
	a = (x > y) ? x : y; // a is greater number
	b = (x < y) ? x : y; // b is smaller number
	r = b;
	while (a % b != 0) {
		r = a % b;
		a = b;
		b = r;
	}
	return r;
}

static class InputReader {
	public BufferedReader reader;
	public StringTokenizer tokenizer;

	public InputReader(InputStream inputstream) {
		reader = new BufferedReader(new InputStreamReader(inputstream));
		tokenizer = null;
	}

	public String nextLine() {
		String fullLine = null;
		while (tokenizer == null || !tokenizer.hasMoreTokens()) {
			try {
				fullLine = reader.readLine();
			} catch (IOException e) {
				throw new RuntimeException(e);
			}
			return fullLine;
		}
		return fullLine;
	}

	public String next() {
		while (tokenizer == null || !tokenizer.hasMoreTokens()) {
			try {
				tokenizer = new StringTokenizer(reader.readLine());
			} catch (IOException e) {
				throw new RuntimeException(e);
			}
		}
		return tokenizer.nextToken();
	}

	public long nextLong() {
		return Long.parseLong(next());
	}

	public int nextInt() {
		return Integer.parseInt(next());
	}
}
}