Problem: Bob is a farmer. He has a large pasture with many sheep. Recently, he has lost some of them due to wolf attacks. He thus decided to place some shepherd dogs in such a way that all his sheep are protected.

The pasture is a rectangle consisting of R × C cells. Each cell is either empty, contains a sheep, a wolf or a dog. Sheep and dogs always stay in place, but wolves can roam freely around the pasture, by repeatedly moving to the left, right, up or down to a neighboring cell. When a wolf enters a cell with a sheep, it consumes it. However, no wolf can enter a cell with a dog.

Initially there are no dogs. Place dogs onto the pasture in such a way that no wolf can reach any sheep, or determine that it is impossible. Note that since you have many dogs, you do not need to minimize their number. 

Input

First line contains two integers R (1 ≤ R ≤ 500) and C (1 ≤ C ≤ 500), denoting the number of rows and the numbers of columns respectively.

Each of the following R lines is a string consisting of exactly C characters, representing one row of the pasture. Here, 'S' means a sheep, 'W' a wolf and '.' an empty cell.

Output

If it is impossible to protect all sheep, output a single line with the word "No".

Otherwise, output a line with the word "Yes". Then print R lines, representing the pasture after placing dogs. Again, 'S' means a sheep, 'W' a wolf, 'D' is a dog and '.' an empty space. You are not allowed to move, remove or add a sheep or a wolf.

If there are multiple solutions, you may print any of them. You don't have to minimize the number of dogs.

Examples

Input

6 6
..S...
..S.W.
.S....
..W...
...W..
......


Output

Yes
..SD..
..SDW.
.SD...
.DW...
DD.W..
......


Input

1 2
SW


Output

No


Input

5 5
.S...
...S.
S....
...S.
.S...


Output

Yes
.S...
...S.
S.D..
...S.
.S...

Note

In the first example, we can split the pasture into two halves, one containing wolves and one containing sheep. Note that the sheep at (2,1) is safe, as wolves cannot move diagonally.

In the second example, there are no empty spots to put dogs that would guard the lone sheep.

In the third example, there are no wolves, so the task is very easy. We put a dog in the center to observe the peacefulness of the meadow, but the solution would be correct even without him.

Solution (in JAVA):

Solution:


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.LinkedHashMap;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.Queue;
import java.util.StringTokenizer;


public class hello2
 {static class FastReader 
       { 
           BufferedReader br; 
           StringTokenizer st; 
     
           public FastReader() 
           { 
               br = new BufferedReader(new
                        InputStreamReader(System.in)); 
           } 
     
           String next() 
           { 
               while (st == null || !st.hasMoreElements()) 
               { 
                   try
                   { 
                       st = new StringTokenizer(br.readLine()); 
                   } 
                   catch (IOException  e) 
                   { 
                       e.printStackTrace(); 
                   } 
               } 
               return st.nextToken(); 
           } 
     
           int nextInt() 
           { 
               return Integer.parseInt(next()); 
           } 
     
           long nextLong() 
           { 
               return Long.parseLong(next()); 
           } 
     
           double nextDouble() 
           { 
               return Double.parseDouble(next()); 
           } 
     
           String nextLine() 
           { 
               String str = ""; 
               try
               { 
                   str = br.readLine(); 
               } 
               catch (IOException e) 
               { 
                   e.printStackTrace(); 
               } 
               return str; 
           } 
         
       }
    
    static String sum (String s)
    {
        String s1 = ""; 
        
        if(s.contains("a"))
            s1+="a";
        if(s.contains("e"))
            s1+="e";
        if(s.contains("i"))
            s1+="i";
        if(s.contains("o"))
            s1+="o";
        if(s.contains("u"))
            s1+="u";
        
            return s1;
            
        
    }
    

    public static HashMap<String, Integer> sortByValue(HashMap<String, Integer> hm) 
    { 
        // Create a list from elements of HashMap 
        List<Map.Entry<String, Integer> > list = 
               new LinkedList<Map.Entry<String, Integer> >(hm.entrySet()); 
  
        // Sort the list 
        Collections.sort(list, new Comparator<Map.Entry<String, Integer> >() { 
            public int compare(Map.Entry<String, Integer> o1,  
                               Map.Entry<String, Integer> o2) 
            { 
                return (o1.getValue()).compareTo(o2.getValue()); 
            } 
        }); 
          
        // put data from sorted list to hashmap  
        HashMap<String, Integer> temp = new LinkedHashMap<String, Integer>(); 
        for (Map.Entry<String, Integer> aa : list) { 
            temp.put(aa.getKey(), aa.getValue()); 
        } 
        return temp; 
    } 
    
    
public static void main(String args[])
    {
        FastReader input =new FastReader();
      
        
        
        	        int n = input.nextInt();
        	        int m = input.nextInt();
        	        
        	  //    int t = input.nextInt();
        	      
        	 //     System.out.println( n + " " + m      + " " +t);
        	    
        	        char c[][] = new char[n][m];
        	        for(int i=0;i<n;i++)
        	        {
        	        	c[i] = input.next().toCharArray();
        	        }
        	        
        	        
        	    	int visited[][] = new int[n][m];
        	    	
        	    	
        	    	Queue<Pair> q = new LinkedList<Pair>();
        	    	int xa[] = new int[] {0,1,-1,0,0};
        	    	int ya[] = new int[] {0,0,0,1,-1};
        	    	
        	    	int d[][] = new int[n][m];
        	    	int k1 = 1;
        	    	int k2 = 1;
        	    	for(int i=0;i<n;i++)
        	    	{
        	    		for(int j=0;j<m;j++)
        	    		{
        	    			d[i][j] = -1;
        	    		}
        	    	}
        	    //	System.out.println(k1 + " " + k2 );
        	    	q.add(new Pair(k1-1,k2-1));
        	    	d[k1-1][k2-1]=0;
        	    	//visited[k1-1][k2-1] = 1;
        	    	int flag=0;
        	    	while(!q.isEmpty())
        	    	{
        	    		Pair p = q.poll();
        	    		int x = p.a;
        	    		int y = p.b;
        	    		
        	    	//	System.out.println(x +  " " + y);
        	    		for(int i=0;i<5;i++)
        	    		{
        	    			int newx = x + xa[i];
        	    			int newy = y + ya[i];
        	    			
        	    	//		System.out.println(newx + " ss " + c[0][1] + newy);
        	    			if(range(newx,newy,n,m) && visited[newx][newy]==0)
        	    			{

        	    				visited[newx][newy] = 1;
        	    				q.add(new Pair(newx,newy));
        	    				
        	    			//System.out.println(newx + "d " + newy);
    	    					
        	    				if(c[newx][newy]=='W')
        	    				{
        	    					for(int j=1;j<5;j++)
        	    					{
        	    						int nx = newx+xa[j];
        	    						int ny = newy+ya[j];
            	    				
        	    					
        	    					if(range(nx,ny,n,m) &&  c[nx][ny]=='.')
        	    					{
        	    						c[nx][ny] = 'D';
        	    					}
        	    					else if(range(nx,ny,n,m) &&  c[nx][ny]=='S')
        	    					{
        	    						flag=1;
        	    						break;
        	    					}
        	    						
        	    						
        	    					
        	    					}
        	    				}
        	    				
        	    				
        	    				
        	    				
        	    			
        	    			}
        	    			if(flag==1)
        	    				break;
        	    			
        	    		}
        	    		
        	    		if(flag==1)
	    					break;
        	    		
        	    		
        	    		
        	    	//	System.out.println("js");
        	    	}
        	  
        	    	if(flag==1)
        	    	{
        	    		System.out.println("NO");
        	    	}
        	    	else
        	    	{	
        	    		System.out.println("YES");
        	    		for(int i=0;i<n;i++)
        	    		{
        	    			for(int j=0;j<m;j++)
        	    			{
        	    				System.out.print(c[i][j]);
        	    			}
        	    			System.out.println();
        	    		}
        	    	}
        	    	
        
        	    
        }
        	  

public static boolean range(int x,int y,int n,int m)
{
	if(x<0 || x>n-1 || y<0 || y>m-1)
		return false;
	
	
	return true;
}
   
public static int even_element(int b[],int n)
{
	int c[] = new int[n/2 + 1];
	int l=0;
	for(int i=1;i<n;i+=2)
	{
		c[l] = b[i];
		
		System.out.print(c[l] + " ");
		l++;
	}
	System.out.println();
	if(c.length!=1)
	{
		return even_element(c,n/2);
	}
	else
		return c[0];
}

      
       	
        	
        	
 
    
    static boolean isPrime(int n) 
    { 
        // Corner case 
        if (n <= 1) 
            return false; 
  
        // Check from 2 to n-1 
        for (int i = 2; i < n; i++) 
            if (n % i == 0) 
                return false; 
  
        return true; 
    } 
 }
 
 
 class Pair
 {
     int a;
     int b;
     Pair(int a,int b)
     {
         this.a=a;
         this.b=b;
     }
 }