# include <iostream>
# include <stdio.h>
# include <cstdio>
# include <cmath>
using namespace std;
bool a[160][160];
int r[12][21][2];
int q[12][21][2];
int t,k;
int n,m;
int mx,my,nx,ny;
int maxx,maxy;
int level=1;
int maxdist(int v)
{
    int i,j;
    int x1,y1,x2,y2;
    int maxd=0,d;

    for(i=1;i<=k;i++)
    {
        x1=r[v][i][0];
        y1=r[v][i][1];
        for(j=i+1;j<=k;j++)
        {
            x2=r[v][j][0];
            y2=r[v][j][1];
            d=abs(x1-x2)+abs(y1-y2);
            if(abs(x1-x2)>maxx)maxx=abs(x1-x2);
            if(abs(y1-y2)>maxy)maxy=abs(y1-y2);
            if(maxd<d)
            {
                maxd=d;
                mx=x1;
                my=y1;
                nx=x2;
                ny=y2;
            }
        }
    }
    //cout<<maxx<<" "<<maxy<<endl;
    return maxd;
}
void makestepnorth(int v)
{
    int i,j;
    int x,y;

    for(i=1;i<=k;i++)
    {
        x=r[v][i][0];
        y=r[v][i][1];
        if(x>1&&!a[x-1][y])
        {
            r[v][i][0]=x-1;
        }
        else
            r[v][i][0]=x;
        r[v][i][1]=y;
    }
}
void makestepsouth(int v)
{
    int i,j;
    int x,y;
    for(i=1;i<=k;i++)
    {
        x=r[v][i][0];
        y=r[v][i][1];
        if(x<n&&!a[x+1][y])
        {
            r[v][i][0]=x+1;
        }
        else
            r[v][i][0]=x;
        r[v][i][1]=y;
    }
}
void makestepwest(int v)
{
    int i,j;
    int x,y;
    for(i=1;i<=k;i++)
    {
        x=r[v][i][0];
        y=r[v][i][1];
        if(y>1&&!a[x][y-1])
        {
            r[v][i][1]=y-1;
        }
        else
            r[v][i][1]=y;
        r[v][i][0]=x;
    }
}
void makestepeast(int v)
{
    int i,j;
    int x,y;
    for(i=1;i<=k;i++)
    {
        x=r[v][i][0];
        y=r[v][i][1];
        if(y<m&&!a[x][y+1])
        {
            r[v][i][1]=y+1;
        }
        else
            r[v][i][1]=y;
        r[v][i][0]=x;
    }
}
int main()
{
freopen("robots.out","w",stdout);
freopen("robots.in","r",stdin);
int i,j;
for(i=0;i<=159;i++)
        for(j=0;j<=159;j++)
        a[i][j]=1;
scanf("%d%d",&n,&m);

char ch;
for(i=1;i<=n;i++)
    for(j=1;j<=m;j++)
{
  cin>>ch;
  if(ch=='.')a[i][j]=0;
  else
        a[i][j]=1;
}
scanf("%d%d",&t,&k);
int td,mind=10000;
/*for(i=1;i<=t;i++)
{
    td=maxdist(i);
    if(mind>td)
    {
        mind=td;
        level=i;
    }
}*/
level=t;
for(i=1;i<=t;i++)
{
    for(j=1;j<=k;j++)
    {
        scanf("%d%d",&r[i][j][0],&r[i][j][1]);
    }
}
int P;
printf("%d\n",level);
int db,d;
int pos=0;
int v=0;
for(P=1;P<=100000;P++)
{
   // cout<<pos<<endl;
    maxx=0;
    maxy=0;
   d=maxdist(level);
   if(d>=db)break;
  //cout<<mx<<" "<<my<<endl;
//   cout<<nx<<" "<<ny<<endl;
//cout<<maxx<<endl;
   //return 0;

   if(maxx>0){
   if(mx>1||nx>1)
   {
       if((a[mx-1][my]==1&&a[nx-1][ny]==0&&nx<mx)||(a[mx-1][my]==0&&a[nx-1][ny]==1&&nx<mx))
          {
              makestepnorth(level);
              printf("N");
              db=d;
              continue;
          }
   }
   if(mx<n||nx<n)
   {
       if((a[mx+1][my]==1&&a[nx+1][ny]==0&&nx<mx)||(a[mx+1][my]==0&&a[nx+1][ny]==1&&nx>mx))
          {
              makestepsouth(level);
              printf("S");
              db=d;
              continue;
          }
   }}
   if(maxy>0){

   if(my>1||ny>1)
   {
       if((a[mx][my-1]==1&&a[nx][ny-1]==0&&ny>my)||(a[mx][my-1]==0&&a[nx][ny-1]==1&&ny<my))
          {
              makestepwest(level);
              printf("W");
              db=d;
              continue;
          }
   }
   if(my<m||ny<m)
   {
       if((a[mx][my+1]==1&&a[nx][ny+1]==0&&ny<my)||(a[mx][my+1]==0&&a[nx][ny+1]==1&&ny>my))
          { //cout<<"&&"<<endl;
              makestepeast(level);
              printf("E");
              db=d;
              continue;
          }
   }
   }

  break;
}
P--;
int answer = P + d*(n+m);
int postanswer;
int north=0,south=0,east=0,west=0;
int T=P;
//cout<<answer<<endl;
//cout<<P<<" "<<d<<endl;
v=0;
for(i=1;i<=k;i++)
{
    q[level][i][0]=r[level][i][0];
    q[level][i][1]=r[level][i][1];
}
while(T<100000&&v<=n)
{
    v++;
    d=maxdist(level);
    north++;
      makestepnorth(level);
      db=d;

      postanswer=T+d*(n+m);
    //cout<<T<<" "<<d<<endl;
      if(postanswer<answer)
      {
          for(i=1;i<north;i++)
            printf("N");
            for(i=1;i<=k;i++)
{
    q[level][i][0]=r[level][i][0];
    q[level][i][1]=r[level][i][1];
}
          north=1;
          P=T;
          answer=postanswer;
      }
      T++;
  }
T=P;
v=0;
for(i=1;i<=k;i++)
{
    r[level][i][0]=q[level][i][0];
    r[level][i][1]=q[level][i][1];
}
for(;P<=100000;P++)
{
   // cout<<pos<<endl;
    maxx=0;
    maxy=0;
   d=maxdist(level);
      if(d>=db)break;
  //cout<<mx<<" "<<my<<endl;
//   cout<<nx<<" "<<ny<<endl;
//cout<<maxx<<endl;
   //return 0;

   if(maxx>0){
   if(mx>1||nx>1)
   {
       if((a[mx-1][my]==1&&a[nx-1][ny]==0&&nx<mx)||(a[mx-1][my]==0&&a[nx-1][ny]==1&&nx<mx))
          {
              makestepnorth(level);
              printf("N");
              db=d;
              continue;
          }
   }
   if(mx<n||nx<n)
   {
       if((a[mx+1][my]==1&&a[nx+1][ny]==0&&nx<mx)||(a[mx+1][my]==0&&a[nx+1][ny]==1&&nx>mx))
          {
              makestepsouth(level);
              printf("S");
              db=d;
              continue;
          }
   }}
   if(maxy>0){

   if(my>1||ny>1)
   {
       if((a[mx][my-1]==1&&a[nx][ny-1]==0&&ny>my)||(a[mx][my-1]==0&&a[nx][ny-1]==1&&ny<my))
          {
              makestepwest(level);
              printf("W");
              db=d;
              continue;
          }
   }
   if(my<m||ny<m)
   {
       if((a[mx][my+1]==1&&a[nx][ny+1]==0&&ny<my)||(a[mx][my+1]==0&&a[nx][ny+1]==1&&ny>my))
          { //cout<<"&&"<<endl;
              makestepeast(level);
              printf("E");
              db=d;
              continue;
          }
   }
   }

  break;
}
while(T<100000&&v<=n)
{
    v++;
    d=maxdist(level);
      makestepsouth(level);
      south++;
      db=d;

      postanswer=T+d*(n+m);

      if(postanswer<answer)
      {
          for(j=1;j<south;j++)
            printf("S");
          south=1;
          P=T;
          for(i=1;i<=k;i++)
{
    q[level][i][0]=r[level][i][0];
    q[level][i][1]=r[level][i][1];
}
          answer=postanswer;
      }
       T++;
  }

T=P;
v=0;
//cout<<answer<<endl;
for(i=1;i<=k;i++)
{
    r[level][i][0]=q[level][i][0];
    r[level][i][1]=q[level][i][1];
}
for(;P<=100000;P++)
{
   // cout<<pos<<endl;
    maxx=0;
    maxy=0;
   d=maxdist(level);
      if(d>=db)break;
  //cout<<mx<<" "<<my<<endl;
//   cout<<nx<<" "<<ny<<endl;
//cout<<maxx<<endl;
   //return 0;

   if(maxx>0){
   if(mx>1||nx>1)
   {
       if((a[mx-1][my]==1&&a[nx-1][ny]==0&&nx<mx)||(a[mx-1][my]==0&&a[nx-1][ny]==1&&nx<mx))
          {
              makestepnorth(level);
              printf("N");
              db=d;
              continue;
          }
   }
   if(mx<n||nx<n)
   {
       if((a[mx+1][my]==1&&a[nx+1][ny]==0&&nx<mx)||(a[mx+1][my]==0&&a[nx+1][ny]==1&&nx>mx))
          {
              makestepsouth(level);
              printf("S");
              db=d;
              continue;
          }
   }}
   if(maxy>0){

   if(my>1||ny>1)
   {
       if((a[mx][my-1]==1&&a[nx][ny-1]==0&&ny>my)||(a[mx][my-1]==0&&a[nx][ny-1]==1&&ny<my))
          {
              makestepwest(level);
              printf("W");
              db=d;
              continue;
          }
   }
   if(my<m||ny<m)
   {
       if((a[mx][my+1]==1&&a[nx][ny+1]==0&&ny<my)||(a[mx][my+1]==0&&a[nx][ny+1]==1&&ny>my))
          { //cout<<"&&"<<endl;
              makestepeast(level);
              printf("E");
              db=d;
              continue;
          }
   }
   }

  break;
}
while(T<100000&&v<=m)
    {
        v++;
        d=maxdist(level);
      makestepeast(level);
      east++;

    postanswer=T+d*(n+m);
  //  cout<<T<<" "<<d<<endl;
  //  cout<<postanswer<<endl;
  //  cout<<r[1][1][0]<<" "<<r[1][1][1]<<endl;
  //  cout<<r[1][2][0]<<" "<<r[1][2][1]<<endl;
      if(postanswer<answer)
      {
          for(i=1;i<east;i++)
            printf("E");
          east=1;
          P=T;
          for(i=1;i<=k;i++)
{
    q[level][i][0]=r[level][i][0];
    q[level][i][1]=r[level][i][1];
}
          answer=postanswer;
      }
      T++;
  }
  T=P;
  v=0;
  for(i=1;i<=k;i++)
{
    r[level][i][0]=q[level][i][0];
    r[level][i][1]=q[level][i][1];
}
for(;P<=100000;P++)
{
   // cout<<pos<<endl;
    maxx=0;
    maxy=0;
   d=maxdist(level);
      if(d>=db)break;
  //cout<<mx<<" "<<my<<endl;
//   cout<<nx<<" "<<ny<<endl;
//cout<<maxx<<endl;
   //return 0;

   if(maxx>0){
   if(mx>1||nx>1)
   {
       if((a[mx-1][my]==1&&a[nx-1][ny]==0&&nx<mx)||(a[mx-1][my]==0&&a[nx-1][ny]==1&&nx<mx))
          {
              makestepnorth(level);
              printf("N");
              db=d;
              continue;
          }
   }
   if(mx<n||nx<n)
   {
       if((a[mx+1][my]==1&&a[nx+1][ny]==0&&nx<mx)||(a[mx+1][my]==0&&a[nx+1][ny]==1&&nx>mx))
          {
              makestepsouth(level);
              printf("S");
              db=d;
              continue;
          }
   }}
   if(maxy>0){

   if(my>1||ny>1)
   {
       if((a[mx][my-1]==1&&a[nx][ny-1]==0&&ny>my)||(a[mx][my-1]==0&&a[nx][ny-1]==1&&ny<my))
          {
              makestepwest(level);
              printf("W");
              db=d;
              continue;
          }
   }
   if(my<m||ny<m)
   {
       if((a[mx][my+1]==1&&a[nx][ny+1]==0&&ny<my)||(a[mx][my+1]==0&&a[nx][ny+1]==1&&ny>my))
          { //cout<<"&&"<<endl;
              makestepeast(level);
              printf("E");
              db=d;
              continue;
          }
   }
   }

  break;
}
  while(T<100000&&v<=m)
  {
v++;
d=maxdist(level);
      makestepwest(level);
      west++;

          postanswer=T+d*(n+m);

       //    cout<<postanswer<<endl;
      if(postanswer<answer)
      {
          for(j=1;j<west;j++)
            printf("W");
          west=1;
          P=T;
          for(i=1;i<=k;i++)
{
    q[level][i][0]=r[level][i][0];
    q[level][i][1]=r[level][i][1];
}
          answer=postanswer;
      }
       T++;
  }
for(;P<=100000;P++)
{
   // cout<<pos<<endl;
    maxx=0;
    maxy=0;
   d=maxdist(level);
      if(d>=db)break;
  //cout<<mx<<" "<<my<<endl;
//   cout<<nx<<" "<<ny<<endl;
//cout<<maxx<<endl;
   //return 0;

   if(maxx>0){
   if(mx>1||nx>1)
   {
       if((a[mx-1][my]==1&&a[nx-1][ny]==0&&nx<mx)||(a[mx-1][my]==0&&a[nx-1][ny]==1&&nx<mx))
          {
              makestepnorth(level);
              printf("N");
              db=d;
              continue;
          }
   }
   if(mx<n||nx<n)
   {
       if((a[mx+1][my]==1&&a[nx+1][ny]==0&&nx<mx)||(a[mx+1][my]==0&&a[nx+1][ny]==1&&nx>mx))
          {
              makestepsouth(level);
              printf("S");
              db=d;
              continue;
          }
   }}
   if(maxy>0){

   if(my>1||ny>1)
   {
       if((a[mx][my-1]==1&&a[nx][ny-1]==0&&ny>my)||(a[mx][my-1]==0&&a[nx][ny-1]==1&&ny<my))
          {
              makestepwest(level);
              printf("W");
              db=d;
              continue;
          }
   }
   if(my<m||ny<m)
   {
       if((a[mx][my+1]==1&&a[nx][ny+1]==0&&ny<my)||(a[mx][my+1]==0&&a[nx][ny+1]==1&&ny>my))
          { //cout<<"&&"<<endl;
              makestepeast(level);
              printf("E");
              db=d;
              continue;
          }
   }
   }

  break;
}
if(P==0)printf("N");
    printf("\n");
   return 0;


}
/*
4 5
.#..#
....#
#.#..
...#.
2 2
4 1
4 5
1 1
4 5



*/