#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)

#ifdef _MSC_VER
#include <intrin.h>

#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif

#include <limits.h>
#include <math.h>
#include <time.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#include<atcoder/all>

using namespace std;

using namespace atcoder;

#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v, n) reverse(v, v + n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define print(x) cout << (x) << endl
#define pe(x) cout << (x) << " "
#define DEBUG(x) cout << #x << ": " << x << endl
#define lb(v, n) lower_bound(v.begin(), v.end(), (n))
#define ub(v, n) upper_bound(v.begin(), v.end(), (n))
#define int long long
//#define double long double
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i, v.size()) cout << v[i] << " \n"[i==(int)v.size()-1]
template <typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }
template <typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
std::random_device rd;
std::mt19937 mt(rd());
constexpr ll MOD = 1e9 + 7;
constexpr int MAX = 500050;
const double pi = acos(-1);
constexpr double EPS = 1e-8;
constexpr ll LINF = 1e18 + 1;
constexpr int INF = 1e14 + 1;
void Yes(bool cond) { cout << (cond ? "Yes" : "No") << '\n'; }
void YES(bool cond) { cout << (cond ? "YES" : "NO") << '\n'; }


int A[101][101];
char B[101][101];
void solve() {
	int N, K; cin >> N >> K;
	REP(i, N)REP(j, N)cin >> A[i][j];
	int s = 2 * N, t = 2 * N + 1;
	int g = 2 * N + 2;
	mcf_graph<ll,ll>G(N * 2 + 3);
	REP(i, N)REP(j, N)B[i][j] = '.';
	REP(i, N) {
		G.add_edge(s, i, K, 0);
		G.add_edge(N + i, t, K, 0);
	}
	REP(i, N) {
		REP(j, N) {
			G.add_edge(i, j + N, 1, INF - A[i][j]);
		}
	}
	//int ans = 0;
	G.add_edge(s, t, K*N, INF);
	G.add_edge(t, g, K*N, 0);
	pii fl = G.flow(s, g);

	ll ans = N*K*INF - fl.second;
	print(ans);
	//int mxf = fl.first;
	//REP(f, mxf + 1) {
	//	fl = G.flow(s, t,f);
	//	int res = fl.first*INF - fl.second;
	//	DEBUG(fl.first);
	//	DEBUG(res);
	//	if (res > ans)chmax(ans, res);
	//}
	//REP(f, mxf + 1) {
	//	fl = G.flow(s, t, f);
	//	int res = fl.first*INF - fl.second;
	//	if (res == ans)break;
	//}
	vector<mcf_graph<ll,ll>::edge>es = G.edges();
	for (auto e : es) {
		if (e.from < N&&e.to < 2 * N&&e.flow>0) {
			int x = e.from, y = e.to - N;
			B[x][y] = 'X';
		}
	}
	REP(i, N) {
		REP(j, N) {
			cout << B[i][j];
		}
		cout << '\n';
	}
}



signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	//int q;
	//cin >> q;
	//while (q--)
	solve();

}



Measured memory_bytes: 4004