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.io.*;
import java.math.BigInteger;
import java.util.*;
 
 
 
 public class Main {
	public static InputReader in;
    public static PrintWriter pw;
 
 
 
	public static void main(String args[]) {
		new Thread(null, new Runnable() {
            public void run() {
                try{
                    solve();
                }
                catch(Exception e){
                    e.printStackTrace();
                }
            }
        }, "1", 1 << 26).start();
    }
	//static HashSet<Integer> set;
	static ArrayList<Integer> g[];
	static ArrayList<Integer> h[];
	//static boolean visited[];
	static long edje=0;
    static boolean vis[];
	static int col[];
	static boolean[] visited;
	static int Parent[];
	static int Ans=0;
	static int min=Integer.MAX_VALUE;
	static boolean vis1[];
	static int degree[];
	static int f[];
	static  int size[];
	static int n;
	static int edjes=0;
	static int start=-1;
	static int end=-1;
	static boolean bool=false;
	static int Total=0;
	static int nums[];
	//static int a[];
	static int fr[];
	static int min1=Integer.MAX_VALUE;
	static TreeSet<String> set;
	static int a[];
	static int time1[];
	static int time2[];
	static int glob=0;
	static  HashSet<Integer>[] s;
	static StringBuilder tmp=new StringBuilder();
	static HashMap<String,String> hm=new HashMap<String,String>();
	
	public static void solve(){
	
		 in = new InputReader(System.in);
		 pw = new PrintWriter(System.out);
	     int n=in.nextInt();
	     int l=in.nextInt();
	     int x=in.nextInt();
	     int y=in.nextInt();
	     int a[]=in.nextIntArray(n);
	     HashSet<Integer> set=new HashSet();
	     for(int i=0;i<n;i++)
	     {
	    	 set.add(a[i]);
	     }
	     boolean b1=false;
	     boolean b2=false;
	     for(int i=0;i<n;i++)
	     {
	    	 if(set.contains(a[i]+x)&&(a[i]+x<=l)||set.contains(a[i]-x))
	    	 {
	    		 b1=true;
	    	 }
	    	 if(set.contains(a[i]+y)&&(a[i]+y<=l)||set.contains(a[i]-y))
	    	 {
	    		 b2=true;
	    	 }
	     }
	    
	     if(b1&&b2)
	     {
	    	 System.out.println(0);
	    	 return;
	     }
	     if(b1)
		    {
		    	System.out.println(1);
		    	System.out.println(a[0]+y);
		    	return;
		    }
	     if(b2)
	     {
	    	 System.out.println(1);
	    	 System.out.println(a[0]+x);
	    	 return;
	     }
	     TreeSet<Integer> one=new TreeSet<Integer>();
	     for(int i=0;i<n;i++)
	     {
	    	 one.add(a[i]+x);
	    	 one.add(a[i]-x);
	     }
	  //  System.out.println(one);
	     TreeSet<Integer> two=new TreeSet();
	     for(int xp:one)
	     {
	    	if(set.contains(xp+y)&&xp+y<=l&&xp>0)
	    	{
	    		//System.out.println(xp+y);
	    		System.out.println(1);
	    		System.out.println(xp);
	    		System.exit(0);
	    	}
	    	if(set.contains(xp-y)&&xp-y>=0&&xp-y<=l&&xp>0&&xp<=l)
	    	{
	    	//	System.out.println(xp-y);
	    		System.out.println(1);
	    		System.out.println(xp);
	    		System.exit(0);
	    	}
	     }
	     System.out.println(2);
	     System.out.println((a[0]+x)+" "+(a[0]+y));
	}
	
	/*
	 SubTree Checker DFS (TO CHECK IF X IS IN A SUBTREE OF Y)
	public static void dfs(int curr)
	{
		visited[curr]=true;
		time1[curr]=glob++;
		for(int x:g[curr])
		{
		if(!visited[x])
			dfs(x);
		}
		time2[curr]=glob++;
	}
    
	
	
 
    /*NO OF EDJES IN WHOLE CONNECTED COMPONENTS
  
	public static void dfs1(int curr)
	{
		visited[curr]=true;
		for(int next:g[curr])
		{
			edje++;
			if(!visited[next])
				dfs1(next);
		}
	}
	/*SUM OF ALL SUBTREE NODE'S VLAUES DFS
	public static void dfs(int curr,int prev)
		{
		val[curr]=1;
			for(int x:g[curr])
			{
				if(x!=prev)
				{
		            dfs(x,curr);
		            val[curr]+=val[x];
					
			    }
			}
		}*/
	
		public static long power(long a,long b)
		{
			long result=1;
			while(b>0)
			{
				if(b%2==1)
					result*=a;
				a=a*a;
				b/=2;
			}
			return result;
		}
				public static long pow(long n,long p,long m)
	{
		 long  result = 1;
		  if(p==0)
		    return 1;
		if (p==1)
		    return n;
		while(p!=0)
		{
		    if(p%2==1)
		        result *= n;
		    if(result>=m)
		    result%=m;
		    p >>=1;
		    n*=n;
		    if(n>=m)
		    n%=m;
		}
		return result;
	}
	static class Pair implements Comparable<Pair>{
	int y;
		int x;
		Pair(int mr,int i){
	     	y=mr;
			x=i;
			
		}
		@Override
		public int compareTo(Pair o) {
		      //  if(o.dis<this.dis)
		        	return 1;
		       // else
		        //	return -1;
			
			}
		
	}
	public static long gcd(long a, long b) {
		  if (b == 0) return a;
		  return gcd(b, a%b);
		}
	static class InputReader {
 
		private InputStream stream;
		private byte[] buf = new byte[8192];
		private int curChar, snumChars;
		private SpaceCharFilter filter;
 
		public InputReader(InputStream stream) {
			this.stream = stream;
		}
 
		public int snext() {
			if (snumChars == -1)
				throw new InputMismatchException();
			if (curChar >= snumChars) {
				curChar = 0;
				try {
					snumChars = stream.read(buf);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (snumChars <= 0)
					return -1;
			}
			return buf[curChar++];
		}
 
		public   int nextInt() {
			int c = snext();
			while (isSpaceChar(c))
				c = snext();
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = snext();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = snext();
			} while (!isSpaceChar(c));
			return res * sgn;
		}
 
		public long nextLong() {
			int c = snext();
			while (isSpaceChar(c))
				c = snext();
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = snext();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = snext();
			} while (!isSpaceChar(c));
			return res * sgn;
		}
 
		public int[] nextIntArray(int n) {
			int a[] = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}
 
		public String readString() {
			int c = snext();
			while (isSpaceChar(c))
				c = snext();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = snext();
			} while (!isSpaceChar(c));
			return res.toString();
		}
 
		public boolean isSpaceChar(int c) {
			if (filter != null)
				return filter.isSpaceChar(c);
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}
 
		public interface SpaceCharFilter {
			public boolean isSpaceChar(int ch);
		}
	}
}