Codeforces Round #514 (Div. 2).B. Forgery

B. Forgery

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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×3square 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).

Examples

input

Copy

3 3
###
#.#
###

output

Copy

YES

input

Copy

3 3
###
###
###

output

Copy

NO

input

Copy

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

output

Copy

YES

input

Copy

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

output

Copy

YES

Note

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).

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define M(a) memset(a,0,sizeof(a))
#define rep(i,a) for(int i=1;i<=a;i++)
#define maxn 1005
char a[maxn][maxn];
int vis[maxn][maxn];

//int c[][3]={{-1,-1},{-1,0},{-1,1},{-1,2},
//            { 0,-1},{ 0,0},{0, 1},{0, 2},
//            { 1,-1},{1, 0},{1, 1},{1, 2},
//            { 2,-1},{2, 0},{2, 1},{2, 2},};

int main()
{
    int n,m;
    while(cin>>n>>m)
    {

        bool flag=true;
        M(a),M(vis);
        rep(i,n){
            rep(j,m){
                cin>>a[i][j];
            }
        }

        for(int i=2;i<=n-1;i++)
        for(int j=2;j<=m-1;j++){
            if(a[i][j]=='.'&&a[i-1][j]=='#'&&a[i+1][j]=='#'&&a[i][j-1]=='#'&&a[i][j+1]=='#'
               &&a[i-1][j-1]=='#'&&a[i+1][j-1]=='#'&&a[i+1][j+1]=='#'&&a[i-1][j+1]=='#'){
                vis[i-1][j-1]=1,vis[i-1][j]=1,vis[i-1][j+1]=1;
                vis[i][j-1]=1,  vis[i][j]=1,  vis[i][j+1]=1;
                vis[i+1][j-1]=1,vis[i+1][j]=1,vis[i+1][j+1]=1;
            }else if(a[i][j]=='#'&&a[i-1][j]=='#'&&a[i+1][j]=='#'&&a[i][j-1]=='#'&&a[i][j+1]=='#'
               &&a[i-1][j-1]=='#'&&a[i+1][j-1]=='#'&&a[i+1][j+1]=='#'&&a[i-1][j+1]=='#'
               &&a[i+2][j-1]=='#'&&a[i+2][j]=='#'&&a[i+2][j+1]=='#'){
                vis[i-1][j-1]=1,vis[i-1][j]=1,vis[i-1][j+1]=1;
                vis[i][j-1]=1,  vis[i][j]=1,  vis[i][j+1]=1;
                vis[i+1][j-1]=1,vis[i+1][j]=1,vis[i+1][j+1]=1;
                vis[i+2][j-1]=1,vis[i+2][j]=1,vis[i+2][j+1]=1;
            }else if(a[i][j]=='#'&&a[i-1][j]=='#'&&a[i+1][j]=='#'&&a[i][j-1]=='#'&&a[i][j+1]=='#'
               &&a[i-1][j-1]=='#'&&a[i+1][j-1]=='#'&&a[i+1][j+1]=='#'&&a[i-1][j+1]=='#'
               &&a[i-1][j+2]=='#'&&a[i][j+2]=='#'&&a[i+1][j+2]=='#'){
                vis[i-1][j-1]=1,vis[i-1][j]=1,vis[i-1][j+1]=1, vis[i-1][j+2]=1;
                vis[i][j-1]=1,  vis[i][j]=1,  vis[i][j+1]=1,   vis[i][j+2]=1;
                vis[i+1][j-1]=1,vis[i+1][j]=1,vis[i+1][j+1]=1, vis[i+1][j+2]=1;
            }
        }
        rep(i,n)
        rep(j,m){
            if(a[i][j]=='#'&&vis[i][j]==0) flag=false;
        }
        if(flag) cout<<"YES"<<endl;
        else cout<<"NO"<<endl;
    }
    return 0;
}