#include <iostream>
#include <vector>
#include <queue>
using namespace std;
const int maxn = 1005;
int n, m;
char mat[maxn][maxn];


bool can_move_left(vector<pair<int, int>> piano) {
    for(pair<int, int> p: piano) {
        int ti = p.first + di[i];
        int tj = p.second + dj[i];


    }
}
int main() {
    ios_base::sync_with_stdio(false);

    cin >> n >> m;

    int f = 0;
    int width = 0;
    for(int i = 0; i < n; i++) {
        int w = 0;
        for(int j = 0; j < m; j++) {
            cin >> mat[i][j];

            if(mat[i][j] == 'F') {
                f++;
                w++;
            }

        }
        width = max(width, w);
    }

    int height = f / width;
    vector<pair<int, int>> piano;

    int pi = 0;
    int pj = 0;
    for(int i = 0; i < n; i++) {

        for(int j =0 ; j < m; j++) {
            if(mat[i][j] == '1') {
                piano.push_back({i, j});
            }
        }
    }



     return 0;
}