#include <bits/stdc++.h>
using namespace std;
template <class T>
T mceil(T a, T b) {
  if (a % b == 0)
    return a / b;
  else
    return a / b + 1;
}
const long long int M = 1e9 + 7;
const long long int N = 2e5 + 5;
const long long int inf = 9e18;
vector<long long int> vis;
vector<vector<long long int> > adj;
void solve() {}
int main() {
  ios_base ::sync_with_stdio(false);
  cin.tie(NULL);
  long long int n, m;
  cin >> n >> m;
  vector<string> v(n);
  for (long long int i = 0; i < n; i++) cin >> v[i];
  set<pair<long long int, long long int> > s;
  vector<vector<long long int> > ans;
  long long int count = 0;
  for (long long int i = 0; i < n; i++) {
    for (long long int j = 0; j < m; j++)
      if (v[i][j] == '*') count++;
  }
  for (long long int i = 1; i < n - 1; i++) {
    for (long long int j = 1; j < m - 1; j++) {
      if (v[i][j] == '.') continue;
      long long int u = 0, d = 0, l = 0, r = 0;
      for (long long int k = i + 1; k < n; k++) {
        if (v[k][j] == '*')
          d++;
        else
          break;
      }
      for (long long int k = j + 1; k < m; k++) {
        if (v[i][k] == '*')
          r++;
        else
          break;
      }
      for (long long int k = i - 1; k >= 0; k--) {
        if (v[k][j] == '*')
          u++;
        else
          break;
      }
      for (long long int k = j - 1; k >= 0; k--) {
        if (v[i][k] == '*')
          l++;
        else
          break;
      }
      long long int mn = min({l, r, u, d});
      if (mn > 0) {
        ans.push_back({i + 1, j + 1, mn});
        for (long long int k = i; k < i + mn + 1; k++) s.insert({k, j});
        for (long long int k = i; k >= i - mn; k--) s.insert({k, j});
        for (long long int k = j; k < j + mn + 1; k++) s.insert({i, k});
        for (long long int k = j; k >= j - mn; k--) s.insert({i, k});
      }
    }
  }
  if ((int)((s).size()) < count) {
    cout << -1 << "\n";
    return 0;
  }
  cout << (int)((ans).size()) << "\n";
  for (long long int i = 0; i < (int)((ans).size()); i++) {
    for (long long int j = 0; j < (int)((ans[i]).size()); j++)
      cout << ans[i][j] << " ";
    cout << "\n";
  }
}
