只有單向的 BFS <--- 此為陷阱
//====================================================================||
// ||
// ||
// Author : GCA ||
// 6AE7EE02212D47DAD26C32C0FE829006 ||
//====================================================================||
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE\_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\\n")
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()
#define De(x)printf(#x"%d\\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\
printf("%d ",dp\[htx\]\[hty\]);}Pln();}
#define M 55
#define PII pair<int,int\>
#define PB push\_back
#define oo INT\_MAX
#define Set\_oo 0x3f
#define Is\_debug true
#define debug(...) if(Is\_debug)printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)
#define FOR(it,c) for(\_\_typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
int nx,ny;
int bx,by;
char mz\[M\]\[M\],mz2\[M\]\[M\];
int qx\[M\*M\*2\];
int qy\[M\*M\*2\];
int front,rear;
int dx\[4\]={0,1,0,-1};
int dy\[4\]={-1,0,1,0};
void printline(){
putchar('|');
for(int i=0;i<nx;i++){
printf("---|");
}Pln();
}
void solve(){
front=rear=0;
fill(&mz2\[0\]\[0\],&mz2\[M-1\]\[M-1\],'?');
qx\[front\]=bx;
qy\[front++\]=by;
mz\[bx\]\[by\]='1';
mz2\[bx\]\[by\]='0';
int d=0;
while(front>rear){
int x=qx\[rear\];
int y=qy\[rear++\];
bool go=false;
for(int i=0;i<4;i++){
int nowx=x+dx\[i\];
int nowy=y+dy\[i\];
if(nowx>=nx||nowx<0||nowy>=ny||nowy<0)continue;
if(mz\[nowx\]\[nowy\]=='X'){
mz2\[nowx\]\[nowy\]='X';
}
if(mz\[nowx\]\[nowy\]=='0'){
mz2\[nowx\]\[nowy\]='0';
if(!go){
mz\[nowx\]\[nowy\]='1';
qx\[front\]=nowx;
qy\[front++\]=nowy;
d++;
}
go=true;
}
}
}
Pln();
printline();
for(int i=0;i<ny;i++){
putchar('|');
for(int j=0;j<nx;j++){
printf(" %c |",mz2\[j\]\[i\]);
}Pln();
printline();
}
printf("\\nNUMBER OF MOVEMENTS: %d\\n",d);
}
int main() {
ios\_base::sync\_with\_stdio(0);
while(~scanf("%d%d",&ny,&nx)&&nx+ny){
Set(mz,0);
scanf("%d%d%\*c",&by,&bx);
bx--;by--;
for(int i=0;i<ny;i++){
for(int j=0;j<nx;j++){
scanf("%c%\*c",&mz\[j\]\[i\]);
}
}
// for(int i=0;i<ny;i++){
// for(int j=0;j<nx;j++){
// printf("%c",mz\[j\]\[i\]);
// }Pln();
// }
solve();
}
}