1 #include <cstdio>
 2 #include <iostream>
 3 #include <queue>
 4 #include <cstring>
 5 using namespace std;
 6 typedef pair<int,int> P;
 7 priority_queue<P,vector<P>,greater<P> > que;
 8 int m,n,sx,sy,tx,ty,a,b,ta,tb,p[31][31],f[31][31],g[31][31],h[31][31],reg[31][31],d[9]={1,2,-1,-2,-1,2,1,-2,1};
 9 void bfs()
10 {
11     while(!que.empty())
12     {
13         int x=que.top().second;que.pop();
14         int a=x/100,b=x%100;
15         if (reg[a][b]) continue;
16         reg[a][b]=1;
17         for (int i=0;i<8;i++)
18         {
19             int ta=a+d[i],tb=b+d[i+1];
20             if (ta>=1&&ta<=m&&tb>=1&&tb<=n&&p[ta][tb]!=2)
21             {
22                 if (p[ta][tb]==0&&f[ta][tb]>f[a][b]+1)
23                 {
24                     f[ta][tb]=f[a][b]+1;
25                     que.push(P(f[ta][tb],ta*100+tb));
26                 }
27                 if (p[ta][tb]!=0&&f[ta][tb]>f[a][b])
28                 {
29                     f[ta][tb]=f[a][b];
30                     que.push(P(f[ta][tb],ta*100+tb));
31                 }
32             }
33         }
34     }
35 }
36 void bfs2()
37 {
38     while(!que.empty())
39     {
40         int x=que.top().second;que.pop();
41         int a=x/100,b=x%100;
42         if (reg[a][b]) continue;
43         reg[a][b]=1;
44         for (int i=0;i<8;i++)
45         {
46             int ta=a+d[i],tb=b+d[i+1];
47             if (ta>=1&&ta<=m&&tb>=1&&tb<=n&&p[ta][tb]!=2)
48             {
49                 if ((p[a][b]==0&&f[ta][tb]==f[a][b]-1)||
50                     (p[a][b]!=0&&f[ta][tb]==f[a][b]))
51                 {
52                     if (g[ta][tb]>g[a][b]+1)
53                     {
54                         h[ta][tb]=h[a][b];
55                         g[ta][tb]=g[a][b]+1;
56                         que.push(P(g[ta][tb],ta*100+tb));
57                     }
58                     else if (g[ta][tb]==g[a][b]+1)
59                         h[ta][tb]+=h[a][b];
60                 }
61             }
62         }
63     }
64 }
65 int main()
66 {
67     memset(f,0x7f,sizeof(f));
68     memset(g,0x7f,sizeof(g));
69     scanf("%d%d",&m,&n);
70     for (int i=1;i<=m;i++)
71         for (int j=1;j<=n;j++)
72         {
73             scanf("%d",&p[i][j]);
74             if (p[i][j]==3) sx=i,sy=j,f[i][j]=0,que.push(P(0,i*100+j));
75             if (p[i][j]==4) tx=i,ty=j;
76         }
77     bfs();
78     if (reg[tx][ty]) printf("%d\n",f[tx][ty]);else{printf("-1\n");return 0;}
79     memset(reg,0,sizeof(reg));
80     g[tx][ty]=0;h[tx][ty]=1;que.push(P(0,tx*100+ty));
81     bfs2();
82     printf("%d\n%d",g[sx][sy],h[sx][sy]);
83 }