#include<cstdio> #include<cstring> #include<iostream> using namespace std; int head=0,tail=1,q,nextx,nexty,nextck,n,m,beginx,beginy,endx,endy; int a[100005],b[100005],ck[100005],pre[100005],x[4]={1,0,-1,0},y[4]={0,1,0,-1},c,t; bool mark[205][205][15]; char maze[205][205]; void print(int d) { if(pre[d]!=0) print(pre[d]); c++; } bool chek(int qx,int qy,int qz) { if(qx<=n-1&&qy<=m-1&&qx>=0&&qy>=0&&qz>=0) return 1; return 0; } void bfs() { memset(b,0,sizeof(b)); memset(a,0,sizeof(a)); memset(ck,0,sizeof(ck)); memset(mark,0,sizeof(mark)); a[1]=beginx; b[1]=beginy; ck[1]=t; mark[beginx][beginy][t]=1; pre[1]=0; head=0;tail=1; while(head!=tail) { head++; for(int i=0;i<=3;i++) { nextx=a[head]+x[i]; nexty=b[head]+y[i]; nextck=ck[head]; if(maze[nextx][nexty]=='#') nextck--; if(!mark[nextx][nexty][nextck]&&chek(nextx,nexty,nextck)) { tail++; a[tail]=nextx; b[tail]=nexty; ck[tail]=nextck; pre[tail]=head; mark[nextx][nexty][nextck]=1; if(a[tail]==endx&&b[tail]==endy) { print(tail); printf("%d\n",c-1); return ; } } } } printf("-1\n"); } int main() { scanf("%d%d%d",&n,&m,&t); for(int i=0;i<n;i++) for(int j=0;j<m;j++) { cin>>maze[i][j]; if(maze[i][j]=='@'){beginx=i;beginy=j;maze[i][j]='.';} if(maze[i][j]=='+'){endx=i;endy=j;maze[i][j]='.';} } bfs(); }