CodeForces 1059B

Description

Student Andrey has been skipping physical education lessons for the whole term, and now he must somehow get a passing grade on this subject. Obviously, it is impossible to do this by legal means, but Andrey doesn't give up. Having obtained an empty certificate from a local hospital, he is going to use his knowledge of local doctor's handwriting to make a counterfeit certificate of illness. However, after writing most of the certificate, Andrey suddenly discovered that doctor's signature is impossible to forge. Or is it?

For simplicity, the signature is represented as an n×mn×m grid, where every cell is either filled with ink or empty. Andrey's pen can fill a 3×33×3 square without its central cell if it is completely contained inside the grid, as shown below.

xxx
x.x
xxx

Determine whether is it possible to forge the signature on an empty n×mn×m grid.

Input

The first line of input contains two integers nn and mm (3≤n,m≤10003≤n,m≤1000).

Then nn lines follow, each contains mm characters. Each of the characters is either '.', representing an empty cell, or '#', representing an ink filled cell.

Output

If Andrey can forge the signature, output "YES". Otherwise output "NO".

You can print each letter in any case (upper or lower).

Sample Input

Input

3 3
###
#.#
###

Output

YES

Input

3 3
###
###
###

Output

NO

Input

4 3
###
###
###
###

Output

YES

Input

5 7
.......
.#####.
.#.#.#.
.#####.
.......

Output

YES

Hint

In the first sample Andrey can paint the border of the square with the center in (2,2)(2,2).

In the second sample the signature is impossible to forge.

In the third sample Andrey can paint the borders of the squares with the centers in (2,2)(2,2) and (3,2)(3,2):

1. we have a clear paper:

   ...
   ...
   ...
   ...

2. use the pen with center at (2,2)(2,2).

   ###
   #.#
   ###
   ...

3. use the pen with center at (3,2)(3,2).

   ###
   ###
   ###
   ###

In the fourth sample Andrey can paint the borders of the squares with the centers in (3,3)(3,3) and (3,5)(3,5).

不知为何，最近总是看错题意，并且非常自信的认为题意就是那样的？

这个问题需要注意一下了，最近这两场比赛全面崩盘都与看错题意有关，是自己太急躁了吗？

题中说了，每一笔都需要是一个完成的3*3的矩阵，且样例2也说明了这一点，但我愣是没看出来，导致一直WA。

很简单，暴力就完事了。

 #include<stdio.h>
 #include<stdlib.h>
 #include<string.h>
 #include<math.h>
 #include<algorithm>
 #include<queue>
 #include<stack>
 #include<deque>
 #include<iostream>
 using namespace std;
 typedef long long  LL;

 char con[][];
 char note[][];
 int way[]= {,,-,,,,,-,,,-,,-,-,,-};

 int main()
 {
     int i,p,j,n,m;
     int flag=;
     scanf("%d%d",&n,&m);
     for(i=; i<=n; i++)
     {
         for(j=; j<=m; j++)
         {
             scanf(" %c",&con[i][j]);
             if(con[i][j]=='.')
             {
                 flag++;
             }
         }
     }

     while()
     {

 //        if(n==3&&m==3&&flag==0)
 //        {
 //            printf("NO\n");
 //            break;
 //        }
         for(i=; i<n; i++)
         {
             for(j=; j<m; j++)
             {
                 for(p=; p<=; p+=)
                 {
                     int x=i+way[p];
                     int y=j+way[p+];
                     if(con[x][y]=='.'&&x>=&&x<=n&&y>=&&y<=m)
                         break;
                 }
                 if(p>)
                 {
                     for(p=; p<=; p+=)
                     {
                         int x=i+way[p];
                         int y=j+way[p+];
                         if(x>=&&x<=n&&y>=&&y<=m)
                         {
                             note[x][y]='#';
                         }
                     }
                 }
             }
         }
         int check=;

         for(i=; i<=n; i++)
         {
             for(j=; j<=m; j++)
             {
                 if(con[i][j]!='.'&&con[i][j]!=note[i][j])
                 {
                     check=;
                     break;
                 }
             }
             if(check==)
                 break;
         }
         if(check==)
             printf("NO\n");
         else
             printf("YES\n");
         break;
     }
     return ;
 }