#include<iostream>

#include<cstdio>

#include<queue>

#include<map>

#include<algorithm>

using namespace std;

//q.front -> head

//q.back -> tail

//mp{

// 0 -> square ; 1 -> edge ; 2-> food

//}

const int dx[]={,-,,};

const int dy[]={,,-,};

struct pos{

    int x,y;

};

struct length{

    int id,len;

}ans[];

map<char,int>to;

deque<pos>sk[];

int n,m,k,mp[][],cnt;

char s[][],op[][];

void bfs(int id,int x,int y)

{

    queue<pos>q;

    q.push((pos){x,y});

    while(!q.empty())

    {

        pos u=q.front();

        sk[id].push_back(u);

        mp[u.x][u.y]=;

        q.pop();

        for(int i=;i<;i++)

        {

            pos th;

            th.x=u.x+dx[i];

            th.y=u.y+dy[i];

            if(s[th.x][th.y]=='#')

                q.push(th),s[th.x][th.y]='.';

        }

    }

}

void work(int x)

{

    for(int i=;i<=cnt;i++)

    {

        if(!sk[i].size())

            continue;

        pos th;

        th.x=sk[i].front().x+dx[to[op[i][x]]];

        th.y=sk[i].front().y+dy[to[op[i][x]]];

        if(mp[th.x][th.y]==)

            sk[i].push_front(th),mp[th.x][th.y]=;

        else if(mp[th.x][th.y]==)

            while(!sk[i].empty())

            {

                mp[sk[i].front().x][sk[i].front().y]=;

                sk[i].pop_front();

            }

        else

        {

            mp[sk[i].back().x][sk[i].back().y]=,mp[th.x][th.y]=;

            sk[i].push_front(th),sk[i].pop_back();

        }

    }

}

bool cmp(const length &x,const length &y)

{

    return x.len==y.len?x.id<y.id:x.len>y.len;

}

int main()

{

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

    to['W']=,to['S']=,to['A']=,to['D']=;

    for(int i=;i<=n;i++)

        mp[i][]=mp[i][m+]=;

    for(int i=;i<=m;i++)

        mp[][i]=mp[n+][i]=;

    for(int i=;i<=n;i++)

        scanf("%s",s[i]+);

    for(int i=;i<=n;i++)

        for(int j=;j<=m;j++)

            if(s[i][j]=='&')

                mp[i][j]=;

            else if(s[i][j]=='@')

                bfs(++cnt,i,j);

    for(int i=;i<=cnt;i++)

        scanf("%s",op[i]+);

    for(int i=;i<=k;i++)

        work(i);

    for(int i=;i<=cnt;i++)

        ans[i].len=sk[i].size(),ans[i].id=i;

    sort(ans+,ans+cnt+,cmp);

    for(int i=;i<=cnt;i++)

        printf("%d %d\n",ans[i].len,ans[i].id);

    int res=;

    for(int i=;i<=n;i++)

        for(int j=;j<=m;j++)

            if(mp[i][j]==)

                res++;

    printf("%d\n",res);

    return ;

}