#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
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 mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

vector<pll> find_keys(ll H, ll W, vector<string> &S){
    vector<pll> keys;
    for (ll i = 0; i < H; i++){
        for (ll j = 0; j < W; j++){
            if (S[i][j] == '#') continue;

            if (i == 0 && S[i + 1][j] == '.'){
                keys.push_back(make_pair(i, j));
            }
            else if (j == 0 && S[i][j + 1] == '.'){
                keys.push_back(make_pair(i, j));
            }
            else if (i > 0 && i + 1 < H && S[i - 1][j] == '#' && S[i + 1][j] == '.'){
                keys.push_back(make_pair(i, j));
            }
            else if (j > 0 && j + 1 < W && S[i][j - 1] == '#' && S[i][j + 1] == '.'){
                keys.push_back(make_pair(i, j));
            }
        }
    }
    return keys;
}

int main() {
    ll H, W;
    cin >> H >> W;
    vector<string> S(H);
    rep(i, H){
        cin >> S[i];
    }
    vector<pll> keys = find_keys(H, W, S);

    ll K = keys.size();
    cout << K << endl;

    for (ll i = 0; i < K; i++){
        ll sx = keys[i].first;
        ll sy = keys[i].second;

        ll len_x = 0;
        ll len_y = 0;
        while (true){
            if (sx + len_x >= H || S[sx + len_x][sy] == '#'){
                break;
            }
            len_x++;
        }
        while (true){
            if (sy + len_y >= W || S[sx][sy + len_y] == '#'){
                break;
            }
            len_y++;
        }
        string ans_x, ans_y;
        if (len_x == 1){
            ans_x = "-";
        }
        else{
            rep(i, len_x) ans_x += 'a';
        }
        if (len_y == 1){
            ans_y = "-";
        }
        else{
            rep(i, len_y) ans_y += 'a';
        }
        cout << ans_y << " " << ans_x << endl;
    }
}