#include <bits/stdc++.h>
using namespace std;
inline int nextint() {
  int temporary;
  scanf("%d", &temporary);
  return temporary;
}
inline long long nextll() {
  long long temporary;
  scanf("%lld", &temporary);
  return temporary;
}
inline double nextdouble() {
  double temporary;
  scanf("%lf", &temporary);
  return temporary;
}
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }
long long leftChild(long long p) { return p << 1; }
long long rightChild(long long p) { return (p << 1) + 1; }
inline long long mid(long long l, long long r) { return (l + r) / 2; }
const long long MOD = 1000000007;
const long long INF = 1e9 + 5;
const double eps = 1e-7;
const double PI = acos(-1.0);
inline bool is_palindrome(const string& s) {
  return std::equal(s.begin(), s.end(), s.rbegin());
}
template <typename T>
void modulize(T& a, const T& b) {
  if (a >= b) {
    a %= b;
  }
}
long long mulmod(long long a, long long b, long long m) {
  long long q = (long long)(((long double)a * (long double)b) / (long double)m);
  long long r = a * b - q * m;
  if (r > m) r %= m;
  if (r < 0) r += m;
  return r;
}
template <typename T, typename S>
T expo(T e, S n) {
  T x = 1, p = e;
  while (n) {
    if (n & 1) x = x * p;
    p = p * p;
    n >>= 1;
  }
  return x;
}
template <typename T>
T power(T e, T n, T& m) {
  T x = 1, p = e;
  while (n) {
    if (n & 1) x = mod(x * p, m);
    p = mod(p * p, m);
    n >>= 1;
  }
  return x;
}
template <typename T>
T powerL(T e, T n, T& m) {
  T x = 1, p = e;
  while (n) {
    if (n & 1) x = mulmod(x, p, m);
    p = mulmod(p, p, m);
    n >>= 1;
  }
  return x;
}
template <typename T>
T InverseEuler(T a, T& m) {
  return (a == 1 ? 1 : power(a, m - 2, m));
}
inline int two(int n) { return 1 << n; }
inline void set_bit(int& n, int b) { n |= two(b); }
inline void unset_bit(int& n, int b) { n &= ~two(b); }
int n, m;
void draw(char newone[][105], int i, int j, int sz) {
  if (!sz) {
    return;
  }
  newone[i][j] = '*';
  int cnt = sz;
  for (long long k = (long long)(i - 1); k >= (long long)(0); k--) {
    newone[k][j] = '*';
    cnt--;
    if (!cnt) {
      break;
    }
  }
  cnt = sz;
  for (long long k = (long long)(j - 1); k >= (long long)(0); k--) {
    newone[i][k] = '*';
    cnt--;
    if (!cnt) {
      break;
    }
  }
  cnt = sz;
  for (long long k = (long long)(i + 1); k < (long long)(n); k++) {
    newone[k][j] = '*';
    cnt--;
    if (!cnt) {
      break;
    }
  }
  cnt = sz;
  for (long long k = (long long)(j + 1); k < (long long)(m); k++) {
    newone[i][k] = '*';
    cnt--;
    if (!cnt) {
      break;
    }
  }
}
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n >> m;
  char mat[n][m];
  int stars[n][m][4];
  memset(stars, 0, sizeof(stars));
  for (long long i = (long long)(0); i < (long long)(n); i++) {
    for (long long j = (long long)(0); j < (long long)(m); j++) {
      cin >> mat[i][j];
    }
  }
  for (long long i = (long long)(0); i < (long long)(n); i++) {
    for (long long j = (long long)(0); j < (long long)(m); j++) {
      if (mat[i][j] == '.') {
        continue;
      }
      int cnt = 0;
      for (long long k = (long long)(i - 1); k >= (long long)(0); k--) {
        if (mat[k][j] != '*') {
          break;
        }
        cnt++;
      }
      stars[i][j][0] = cnt;
      cnt = 0;
      for (long long k = (long long)(j - 1); k >= (long long)(0); k--) {
        if (mat[i][k] != '*') {
          break;
        }
        cnt++;
      }
      stars[i][j][1] = cnt;
      cnt = 0;
      for (long long k = (long long)(i + 1); k < (long long)(n); k++) {
        if (mat[k][j] != '*') {
          break;
        }
        cnt++;
      }
      stars[i][j][2] = cnt;
      cnt = 0;
      for (long long k = (long long)(j + 1); k < (long long)(m); k++) {
        if (mat[i][k] != '*') {
          break;
        }
        cnt++;
      }
      stars[i][j][3] = cnt;
    }
  }
  vector<int> x, y, sz;
  char newone[105][105];
  memset(newone, '.', sizeof(newone));
  for (long long i = (long long)(0); i < (long long)(n); i++) {
    for (long long j = (long long)(0); j < (long long)(m); j++) {
      int mins = min(stars[i][j][0], stars[i][j][1]);
      mins = min(mins, stars[i][j][2]);
      mins = min(mins, stars[i][j][3]);
      if (mins) {
        x.push_back(i + 1);
        y.push_back(j + 1);
        sz.push_back(mins);
        draw(newone, i, j, mins);
      }
    }
  }
  for (long long i = (long long)(0); i < (long long)(n); i++) {
    for (long long j = (long long)(0); j < (long long)(m); j++) {
      if (mat[i][j] != newone[i][j]) {
        cout << -1;
        return 0;
      }
    }
  }
  cout << x.size() << "\n";
  for (long long i = (long long)(0); i < (long long)(x.size()); i++) {
    cout << x[i] << " " << y[i] << " " << sz[i] << "\n";
  }
  return 0;
}
