#include <bits/stdc++.h>
namespace chtholly {
inline int read() {
  int x = 0, f = 1;
  char c = getchar();
  for (; !isdigit(c); c = getchar()) f ^= c == '-';
  for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ '0');
  return f ? x : -x;
}
template <typename mitsuha>
inline bool read(mitsuha &x) {
  x = 0;
  int f = 1;
  char c = getchar();
  for (; !isdigit(c) && ~c; c = getchar()) f ^= c == '-';
  if (!~c) return 0;
  for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ '0');
  return x = f ? x : -x, 1;
}
template <typename mitsuha>
inline int write(mitsuha x) {
  if (!x) return 0 & putchar(48);
  if (x < 0) x = -x, putchar('-');
  int bit[20], i, p = 0;
  for (; x; x /= 10) bit[++p] = x % 10;
  for (i = p; i; --i) putchar(bit[i] + 48);
  return 0;
}
inline char fuhao() {
  char c = getchar();
  for (; isspace(c); c = getchar())
    ;
  return c;
}
}  // namespace chtholly
using namespace chtholly;
using namespace std;
struct llx {
  int x, y, d;
};
vector<llx> ans;
int mk[1010][1010], n = read(), m = read();
char c[1010][1010];
bool judge(int i, int j, int k) {
  return i + k <= n && i - k > 0 && j + k <= m && j - k > 0 &&
         c[i + k][j] == '*' && c[i - k][j] == '*' && c[i][j + k] == '*' &&
         c[i][j - k] == '*';
}
int main() {
  int i, j, k;
  for (i = 1; i <= n; ++i) scanf("%s", c[i] + 1);
  for (i = 1; i <= n; ++i) {
    for (j = 1; j <= m; ++j) {
      if (c[i][j] == '*') {
        for (k = 1; k < n; ++k) {
          if (judge(i, j, k)) {
            mk[i][j] = mk[i + k][j] = mk[i - k][j] = mk[i][j + k] =
                mk[i][j - k] = 1;
          } else {
            if (k > 1) ans.push_back(llx{i, j, k - 1});
            break;
          }
        }
      }
    }
  }
  for (i = 1; i <= n; ++i) {
    for (j = 1; j <= m; ++j) {
      if (c[i][j] == '*' && !mk[i][j]) return puts("-1"), 0;
    }
  }
  cout << ans.size() << endl;
  for (llx zxy : ans) printf("%d %d %d\n", zxy.x, zxy.y, zxy.d);
}
