#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }

// ----------------------------------------------------------------------
// ----------------------------------------------------------------------

struct MinCostFlow {
  struct edge { ll to, cap, cost, rev, idx; bool isrev; };
  struct vertex { ll d, from, pos; };
  vector<vector<edge>> adj;
  vector<ll> potential;
  vector<vertex> minlen;

  MinCostFlow(ll n) { adj.resize(n); potential.resize(n); }
  void add_edge(ll from, ll to, ll cap, ll cost, ll idx = -1) {
    adj[from].push_back({to, cap, cost, (ll)adj[to].size(), idx, false});
    adj[to].push_back({from, 0, -1*cost, (ll)adj[from].size()-1, idx, true});
  }
  ll dijkstra(ll from, ll to) {
    ll N = adj.size();
    auto c = [](const p_ll &x, const p_ll &y){return x.second>y.second;};
    priority_queue<p_ll, vector<p_ll>, decltype(c)> q(c);
    minlen.assign(N,{LLINF,-1,-1}); minlen[from] = {0,-1,-1}; q.push(make_pair(from,0));
    while(q.size()) {
      p_ll now = q.top(); q.pop();
      ll np = now.first, nd = now.second;
      if (nd>minlen[np].d) continue;
      for (auto x: adj[np]) {
        if (x.cap==0||minlen[x.to].d<=minlen[np].d+x.cost) continue;
        q.push(make_pair(x.to, minlen[np].d+x.cost));
        minlen[x.to] = {minlen[np].d+x.cost, np, adj[x.to][x.rev].rev};
      }
    }
    return minlen[to].d;
  }
  ll dfs(ll from, ll to, ll flow) {
    if (from==to) return flow;
    auto &e = adj[minlen[to].from][minlen[to].pos];
    ll f = dfs(from, minlen[to].from, min(flow, e.cap));
    e.cap -= f;
    adj[e.to][e.rev].cap += f;
    return f;
  }
  ll calc(ll from, ll to, ll cost) {
    while(true) {
      if (cost==0||dijkstra(from, to)==LLINF) {
        ll result = 0;
        rep(i,adj.size()) {
          for (auto &x: adj[i]) {
            if (!x.isrev) {
              edge rev = adj[x.to][x.rev];
              result += rev.cap * x.cost;
            }
          }
        }
        return result;
      }
      cost -= dfs(from, to, cost);
    }
    return 0;
  }
  void output() {
    rep(i,adj.size()) {
      for (auto &x: adj[i]) {
        if (!x.isrev) {
          edge rev = adj[x.to][x.rev];
          cout << x.idx << ":" << i << "->" << x.to << " " << rev.cap << "/" << x.cap+rev.cap << endl;
        }
      }
    }
  }
};

// ----------------------------------------------------------------------
// ----------------------------------------------------------------------

int main() {
  ll N, K; cin >> N >> K;
  ll A[N*2][N*2] = {}; rep(i,N) rep(j,N) cin >> A[i][j];
  ll ma = 0; rep(i,N) rep(j,N) ma = max(ma,A[i][j]);

  MinCostFlow mcf(N*4+2);
  rep(i,N*2) mcf.add_edge(0,i+1,K,0);
  rep(i,N*2) rep(j,N*2) mcf.add_edge(i+1,N*2+j+1,1,ma-A[i][j]);
  rep(i,N*2) mcf.add_edge(N*2+i+1,N*4+1,K,0);

  ll sum = N*2*K*ma - mcf.calc(0,N*4+1,LLINF);
  cout << sum << endl;
  string result[N]; rep(i,N) rep(j,N*2) result[i] += '.';
  rep(i,N) for (auto &x: mcf.adj[i+1]) {
    if (!x.isrev&&!x.cap) result[i][x.to-(N*2+1)] = 'X';
  }
  rep(i,N) cout << result[i].substr(0,N) << endl;
  return 0;
}

Measured memory_bytes: 4572