| 52 | } |
| 53 | |
| 54 | int main() { |
| 55 | scanf("%d%d%d",&n,&m,&k); |
| 56 | |
| 57 | T = (m>>1); |
| 58 | |
| 59 | for(int i=0;i<n;i++) { |
| 60 | for(int j=0;j<m;j++) { |
| 61 | scanf("%d",&mat[i][j]); |
| 62 | } |
| 63 | } |
| 64 | // -1 in the array means that we haven't visited that state |
| 65 | memset(dp, -1, sizeof(dp)); |
| 66 | |
| 67 | int ans = solve(0,0,T,0); |
| 68 | |
| 69 | printf("%d\n",ans); |
| 70 | |
| 71 | return 0; |
| 72 | } |