#include<set>

 #include<cmath>

 #include<queue>

 #include<vector>

 #include<cstdio>

 #include<cstring>

 #include<iostream>

 #include<algorithm>

 #define FOR(a,b,c) for(int a=(b);a<=(c);a++)

 using namespace std;

 const int N = ;

 const int inf = 0xf0f0f0f;

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

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

 int n,m,K,st[N][N];

 int vis[N][N],a[N][N],f[N][N][<<N],pre[N][N][<<N];

 int pack(int i,int j) { return i*+j; }

 void unpack(int x,int& i,int& j) { i=x/,j=x%; }

 int pack2(int i,int j,int st) { return i*+j*+st; }

 void unpack2(int x,int& i,int& j,int& st) { st=x%,i=x/,j=(x/)%; }

 int upd(int i,int j,int s,int x,int y,int s2,int w)

 {

     if(f[i][j][s]>w) return f[i][j][s]=w,pre[i][j][s]=pack2(x,y,s2),;

     return ;

 }

 queue<int> q;

 int inq[N*N];

 void spfa(int sta)

 {

     while(!q.empty()) {

         int u=q.front(),i,j; q.pop();

         inq[u]=;

         unpack(u,i,j);

         FOR(k,,) {

             int x=i+dx[k],y=j+dy[k],tmp;

             if(x<||x>=n||y<||y>=m) continue;

             if(upd(x,y,sta,i,j,sta,f[i][j][sta]+a[x][y])&&(!inq[tmp=pack(x,y)])) {

                 q.push(tmp),inq[tmp]=;

             }

         }

     }

 }

 void dfs(int i,int j,int st)

 {

     int x,y,nst;

     vis[i][j]=;

     if(!pre[i][j][st]) return ;

     unpack2(pre[i][j][st],x,y,nst);

     dfs(x,y,nst);

     if(x==i&&y==j) dfs(x,y,st-nst);

 }

 int main()

 {

     //freopen("trip.in","r",stdin);

     //freopen("trip.out","w",stdout);

     memset(f,0xf,sizeof(f));

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

     FOR(i,,n-) FOR(j,,m-) {

         scanf("%d",&a[i][j]);

         if(!a[i][j]) st[i][j]=<<(K++),f[i][j][st[i][j]]=;

     }

     int all=(<<K),tmp;

     FOR(sta,,all-) {

         FOR(i,,n-) FOR(j,,m-) {

             for(int s=sta&(sta-);s;s=(s-)&sta)

                 upd(i,j,sta,i,j,s,f[i][j][s]+f[i][j][sta-s]-a[i][j]);

             if(f[i][j][sta]!=inf) q.push(tmp=pack(i,j)),inq[tmp]=;

         }

         spfa(sta);

     }

     FOR(i,,n-) FOR(j,,m-) if(!a[i][j]) {

         printf("%d\n",f[i][j][all-]);

         dfs(i,j,all-);

         FOR(ii,,n-) {

             FOR(jj,,m-) {

                 if(!a[ii][jj]) putchar('x');

                 else if(vis[ii][jj]) putchar('o');

                 else putchar('_');

             }

             puts("");

         }

         return ;

     }

 }