#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e9 + 10;
const int maxn = 1e2 + 30;
const int maxq = 1e5 + 10;
const int alf = 26;
const long long dlm = 1e9 + 7;
const long long P = 998244353;
const int eps = 1e-7;
int dp[maxn][maxn], c[maxn][maxn];
vector<pair<pair<int, int>, int> > li;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, m;
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    string st;
    cin >> st;
    for (int j = 1; j <= m; j++) {
      dp[i][j] = (st[j - 1] == '*' ? 1 : 0);
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      int z = n;
      int ok;
      for (z = n; z >= 1; z--) {
        ok = 1;
        for (int f = z + i; f >= (i - z); f--) {
          if (dp[f][j] == 0) ok = 0;
        }
        for (int f = z + j; f >= (j - z); f--) {
          if (dp[i][f] == 0) ok = 0;
        }
        if (ok == 0) continue;
        for (int f = z + i; f >= (i - z); f--) {
          c[f][j] = 1;
        }
        for (int f = z + j; f >= (j - z); f--) {
          c[i][f] = 1;
        }
        li.push_back({{i, j}, z});
        break;
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      if (dp[i][j] == 1 && c[i][j] == 0) return cout << "-1", 0;
    }
  }
  cout << li.size() << '\n';
  for (int i = 0; i < li.size(); i++) {
    cout << li[i].first.first << " " << li[i].first.second << " "
         << li[i].second << "\n";
  }
  return 0;
}
