#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include #include using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define vi vector #define vs vector #define vc vector #define vl vector #define vvi vector> #define vvc vector> #define vvl vector> #define vvvi vector>> #define vvvl vector>> #define pii pair #define pil pair #define pli pair #define pll pair #define vpii vector> #define vpll vector> #define vvpii vector>> #define vvpll vector>> template void debug(T e){ cerr << e << endl; } template void debug(vector &v){ rep(i, v.size()){ cerr << v[i] << " "; } cerr << endl; } template void debug(vector> &v){ rep(i, v.size()){ rep(j, v[i].size()){ cerr << v[i][j] << " "; } cerr << endl; } } template void debug(vector> &v){ rep(i,v.size()){ cerr << v[i].first << " " << v[i].second << endl; } } template void debug(set &st){ for (auto itr = st.begin(); itr != st.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template void debug(multiset &ms){ for (auto itr = ms.begin(); itr != ms.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template void debug(map &mp){ for (auto itr = mp.begin(); itr != mp.end(); itr++){ cerr << itr->first << " " << itr->second << endl; } } void debug_out(){ cerr << endl; } template void debug_out(Head H, Tail... T){ cerr << H << " "; debug_out(T...); } int main(){ int H, W; cin >> H >> W; vector S(H); rep(i,H) cin >> S[i]; vector> vec(H, vector(W)); rep(i,H){ rep(j,W){ vec[i][j] = (int)(S[i][j] - 'a'); } } string ans = ""; vector> can(H, vector(W, false)); can[0][0] = true; ans += S[0][0]; for (int i = 0; i < H + W - 2; i++){ int min_vec = 27; for (int j = 0; j < H; j++){ if (i - j < 0 || i - j >= W){ continue; } if (can[j][i - j]){ if (j + 1 < H){ min_vec = min(min_vec, vec[j + 1][i - j]); } if (i - j + 1 < W){ min_vec = min(min_vec, vec[j][i - j + 1]); } } } for (int j = 0; j < H; j++){ if (i - j < 0 || i - j >= W){ continue; } if (can[j][i - j]){ if (j + 1 < H){ if (vec[j + 1][i - j] == min_vec){ can[j + 1][i - j] = true; } } if (i - j + 1 < W){ if (vec[j][i - j + 1] == min_vec){ can[j][i - j + 1] = true; } } } } //debug(min_vec); ans += (char)(min_vec + 'a'); } //debug(can); cout << ans << endl; }