#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<ctime>
#include<queue>

using namespace std;

#define N 151
#define T 11
#define K 21


const int Iterations=10;
const int maximum=1000000000;
const int maxlen=100000;
const int L=24;

clock_t beg;

int n,m,t,k;
char arr[N][N];
pair<int,int> robots[T][K];

string res1;
int num=maximum,test;

struct newStruct
{
    pair<int,int> p[K];
    int fitness;
    string ins;
};

newStruct tmp[4];
newStruct r[L];

void input()
{
    char c;
    int i,j;

    scanf("%d %d",&n,&m);
    scanf("%c",&c);

    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
            scanf("%c",&arr[i][j]);
        scanf("%c",&c);
    }

    scanf("%d %d",&t,&k);

    for(i=0;i<t;i++)
        for(j=0;j<k;j++)
        {
            scanf("%d %d",&robots[i][j].first,&robots[i][j].second);
        }
}

void output()
{
    int i;

    for(i=0;i<res1.size();i++)
        printf("%c",res1[i]);
    printf("\n");
}

bool used[N][N];
char arrow[N][N];

void  bfs(int x,int y)
{
    queue<pair<int,int>> q;
    pair<int,int> p;

    int i,j;

    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
         used[i][j]=0;

    q.push(make_pair(x,y));
    used[x][y]=1;
    arrow[x][y]='F';

    while(!q.empty())
    {
        p=q.front();
        q.pop();

        x=p.first;
        y=p.second;

        //cout<<arrow[x][y]<<" "<<x<<" - "<<y<<endl;
        //cout<<s[x][y]<<endl;

        if(x<=0 || x>n || y<=0 || y>m)
            continue;
        if(arr[x][y]=='#')
            continue;

        if(!used[x+1][y])
        {
            used[x+1][y]=1;
            arrow[x+1][y]='S';
            q.push(make_pair(x+1,y));
        }
        if(!used[x-1][y])
        {
            used[x-1][y]=1;
            arrow[x-1][y]='N';
            q.push(make_pair(x-1,y));
        }
        if(!used[x][y+1])
        {
            used[x][y+1]=1;
            arrow[x][y+1]='E';
            q.push(make_pair(x,y+1));
        }
        if(!used[x][y-1])
        {
            used[x][y-1]=1;
            arrow[x][y-1]='W';
            q.push(make_pair(x,y-1));
        }
    }
}

pair<string,int> doInstructions(int x,int y)
{
    pair<string,int> res2;

    res2.first="";
    res2.second=0;

    while(arrow[x][y]!='F')
    {
        //cout<<x<<" - "<<y<<endl;

        res2.second++;
        res2.first+=arrow[x][y];
        if(arrow[x][y]=='N')
            x++;
        else
        {
            if(arrow[x][y]=='S')
                x--;
            else
            {
                if(arrow[x][y]=='W')
                    y++;
                else
                    if(arrow[x][y]=='E')
                        y--;
            }
        }
    }

    reverse(res2.first.begin(),res2.first.end());

    return res2;
}

int findScoreTest1(int test,string s)
{
    int i,j,maxi=0;

    if(s.size()==0 ||s.size()>=maxlen)
        return maximum;

    for(i=0;i<k;i++)
        for(j=1;j<k;j++)
            maxi=max(abs(robots[test][i].first-robots[test][j].first)+abs(robots[test][i].second-robots[test][j].second),maxi);

    return maxi*(n+m)+s.size();
}

int findScoreTest2(int ind)
{
    int i,j,maxi=0;

    if(r[ind].ins.size()==0 || r[ind].ins.size()>=maxlen)
        return maximum;

    for(i=0;i<k;i++)
        for(j=1;j<k;j++)
            maxi=max(abs(r[ind].p[i].first-r[ind].p[j].first)+abs(r[ind].p[i].second-r[ind].p[j].second),maxi);

    return maxi*(n+m)+r[ind].ins.size();
}

int findScoreTest3(int ind)
{
    int i,j,maxi=0;

    if(tmp[ind].ins.size()==0 || tmp[ind].ins.size()>=maxlen)
        return maximum;

    for(i=0;i<k;i++)
        for(j=1;j<k;j++)
            maxi=max(abs(tmp[ind].p[i].first-tmp[ind].p[j].first)+abs(tmp[ind].p[i].second-tmp[ind].p[j].second),maxi);

    return maxi*(n+m)+tmp[ind].ins.size();
}

bool cmp(newStruct x,newStruct y)
{
    return x.fitness<y.fitness;
}


void mutate(int test,string s)
{
    int i,j;

    for(i=0;i<4;i++)
    {
        for(j=0;j<k;j++)
            tmp[i].p[j]=robots[test][j];
        tmp[i].ins=s;
    }

    tmp[0].ins+="N";
    for(i=0;i<k;i++)
    {
        if(tmp[0].p[i].first==1)
            continue;
        if(arr[tmp[0].p[i].first-1][tmp[0].p[i].second]=='#')
            continue;
        tmp[0].p[i].first--;
    }

    tmp[1].ins+="S";
    for(i=0;i<k;i++)
    {
        if(tmp[1].p[i].first==n)
            continue;
        if(arr[tmp[1].p[i].first+1][tmp[1].p[i].second]=='#')
            continue;
        tmp[1].p[i].first++;
    }

    tmp[2].ins+="W";
    for(i=0;i<k;i++)
    {
        if(tmp[2].p[i].second==1)
            continue;
        if(arr[tmp[2].p[i].first][tmp[2].p[i].second-1]=='#')
            continue;
        tmp[2].p[i].first--;
    }

    tmp[3].ins+="E";
    for(i=0;i<k;i++)
    {
        if(tmp[3].p[i].second==m)
            continue;
        if(arr[tmp[3].p[i].first][tmp[3].p[i].second+1]=='#')
            continue;
        tmp[3].p[i].first++;
    }

    for(i=0;i<4;i++)
        tmp[i].fitness=findScoreTest3(i);

    sort(tmp,tmp+4,cmp);
}

void mutate2(int ind)
{
    int i;

    for(i=0;i<4;i++)
        tmp[i]=r[ind];

    tmp[0].ins+="N";
    for(i=0;i<k;i++)
    {
        if(tmp[0].p[i].first==0)
            continue;
        if(arr[tmp[0].p[i].first-1][tmp[0].p[i].second]=='#')
            continue;
        tmp[0].p[i].first--;
    }

    tmp[1].ins+="S";
    for(i=0;i<k;i++)
    {
        if(tmp[1].p[i].first==n-1)
            continue;
        if(arr[tmp[1].p[i].first+1][tmp[1].p[i].second]=='#')
            continue;
        tmp[1].p[i].first++;
    }

    tmp[2].ins+="W";
    for(i=0;i<k;i++)
    {
        if(tmp[2].p[i].second==0)
            continue;
        if(arr[tmp[2].p[i].first][tmp[2].p[i].second-1]=='#')
            continue;
        tmp[2].p[i].second--;
    }

    tmp[3].ins+="E";
    for(i=0;i<k;i++)
    {
        if(tmp[3].p[i].second==m-1)
            continue;
        if(arr[tmp[3].p[i].first][tmp[3].p[i].second+1]=='#')
            continue;
        tmp[3].p[i].second++;
    }

    for(i=0;i<4;i++)
        tmp[i].fitness=findScoreTest3(i);

    sort(tmp,tmp+4,cmp);
}

pair<string,int> evolve(pair<string,int> res2,int test)
{
    int i,j;

    for(i=0;i<L;i++)
        for(j=0;j<k;j++)
            r[i].p[j]=robots[test][j];

    r[0].fitness=findScoreTest2(0);

    for(i=1;i<L;i++)
        r[i].fitness=r[0].fitness;

    for(i=0;i<L;i++)
        r[i].ins=res2.first;

    for(j=0;j<Iterations;j++)
    {
        //cout<<j<<endl;
        sort(r,r+L,cmp);

        //for(i=0;i<24;i++)
        //    cout<<r[i].fitness<<" "<<r[i].s<<" "<<i<<endl;

        for(i=0;i<1;i++)
        {
            mutate2(i);
            r[14]=tmp[0];
            r[15]=tmp[1];
            r[16]=tmp[2];
            r[17]=tmp[3];
        }
        for(i=1;i<2;i++)
        {
            mutate2(i);
            r[18]=tmp[0];
            r[19]=tmp[1];
            r[20]=tmp[2];
        }
        for(i=2;i<3;i++)
        {
            mutate2(i);
            r[21]=tmp[0];
            r[22]=tmp[1];
        }
        for(i=3;i<4;i++)
        {
            mutate2(i);
            r[23]=tmp[0];
        }
        for(i=4;i<14;i++)
        {
            mutate2(i);
            r[i]=tmp[0];
        }

        //cin.get();
    }

    sort(r,r+L,cmp);

    //cout<<res2.first<<endl;
    //cout<<r[0].ins<<" "<<r[0].fitness<<endl;

    return make_pair(r[0].ins,r[0].fitness);
}

pair<string,int> improve(pair<string,int> res2,int test)
{
    int i,j;

    for(i=0;i<res2.first.size();i++)
    {
        if(res2.first[i]=='N')
        {
            for(j=0;j<k;j++)
            {
                if(robots[test][j].first==1)
                    continue;
                if(arr[robots[test][j].first-1][robots[test][j].second]=='#')
                    continue;
                robots[test][j].first--;
            }
        }
        if(res2.first[i]=='S')
        {
            for(j=0;j<k;j++)
            {
                if(robots[test][j].first==n)
                    continue;
                if(arr[robots[test][j].first+1][robots[test][j].second]=='#')
                    continue;
                robots[test][j].first++;
            }
        }
        if(res2.first[i]=='W')
        {
            for(j=0;j<k;j++)
            {
                if(robots[test][j].second==1)
                    continue;
                if(arr[robots[test][j].first][robots[test][j].second-1]=='#')
                    continue;
                robots[test][j].second--;
            }
        }
        if(res2.first[i]=='E')
        {
            for(j=0;j<k;j++)
            {
                if(robots[test][j].first==m)
                    continue;
                if(arr[robots[test][j].first][robots[test][j].second+1]=='#')
                    continue;
                robots[test][j].second++;
            }
        }
    }

    res2.second=findScoreTest1(test,res2.first);

    //if((double)(clock()-beg)/CLOCKS_PER_SEC<4.6)
        res2=evolve(res2,test);

    return res2;
}

pair<string,int> solve(int test)
{
    int i,j,x,y;
    bool done=0;
    pair<string,int> p,res2;

    bfs(robots[test][0].first,robots[test][0].second);

    for(i=1;i<=n && !done;i++)
        for(j=1;j<=n && !done;j++)
            if(used[i][j] && arr[i][j]!='#')
            {
                x=i;
                y=j;
                done=1;
            }

   // cout<<x<<" - "<<y<<endl;

    res2.first="";
    res2.second=0;

    p=doInstructions(x,y);

    res2.first+=p.first;
    res2.second+=p.second;

    for(i=1;i<k;i++)
    {
        bfs(robots[test][i].first,robots[test][i].second);

        p=doInstructions(x,y);

        res2.first+=p.first;
        res2.second+=p.second;
    }

    res2=improve(res2,test);

    return res2;
}

int main ()
{
    int i;
    pair<string,int> p;

    beg=clock();

    freopen("robots.in","r",stdin);
    freopen("robots.out","w",stdout);

    input();

    p=solve(0);
    res1=p.first;
    num=p.second;
    test=0;

    for(i=1;i<t;i++)
    {
        p=solve(i);
        if(p.second<num)
        {
            num=p.second;
            res1=p.first;
            test=i;
        }
    }

    //cout<<test+1<<endl;
    printf("%d\n",test+1);
    //cout<<num<<endl;

    output();

    return 0;
}