#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e9 + 9;
const long long N = 105;
bool visited[N][N];
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  long long n, m;
  cin >> n >> m;
  string s[n];
  bool ok = true;
  vector<pair<pair<long long, long long>, long long> > ans;
  for (long long i = 0; i < n; i++) {
    cin >> s[i];
  }
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < m; j++) {
      if (s[i][j] == '*') {
        long long a, b, c, d;
        a = b = c = d = 0;
        long long p, q;
        p = i;
        q = j;
        while (q >= 0) {
          if (s[p][q] == '*')
            a++;
          else
            break;
          q--;
        }
        p = i;
        q = j;
        while (q < m) {
          if (s[p][q] == '*')
            b++;
          else
            break;
          q++;
        }
        p = i;
        q = j;
        while (p >= 0) {
          if (s[p][q] == '*')
            c++;
          else
            break;
          p--;
        }
        p = i;
        q = j;
        while (p < n) {
          if (s[p][q] == '*')
            d++;
          else
            break;
          p++;
        }
        long long mn = min({a, b, c, d});
        if (mn <= 1) continue;
        for (long long p = i; p <= i + mn - 1; p++) visited[p][j] = true;
        for (long long p = i; p >= i - mn + 1; p--) visited[p][j] = true;
        for (long long q = j; q <= j + mn - 1; q++) visited[i][q] = true;
        for (long long q = j; q >= j - mn + 1; q--) visited[i][q] = true;
        ans.push_back({{i + 1, j + 1}, mn - 1});
      }
    }
  }
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < m; j++) {
      if (s[i][j] == '*' && visited[i][j] == false) {
        ok = false;
        break;
      }
    }
  }
  if (!ok) {
    cout << -1 << '\n';
    return 0;
  }
  cout << ans.size() << '\n';
  for (auto z : ans)
    cout << z.first.first << " " << z.first.second << " " << z.second << '\n';
  return 0;
}
