#include<cstdio>

#include<algorithm>

#include<cstring>

#include<stack>

using namespace std;

const int maxn = ;

int room_map[maxn][maxn];

bool color[maxn][maxn];

int RoomArea;

int maxRoomArea;

int RoomNum;

struct room

{

    int r, c;

    room(int rr, int cc):r(rr),c(cc) {};

};

void bfs(int r,int c)

{

    stack<room> stk;

    stk.push(room(r, c));

    while (!stk.empty())

    {

        room rm = stk.top();

        int x = rm.r;

        int y = rm.c;

        if (color[x][y])

            stk.pop();

        else

        {

            RoomArea++;

            color[x][y] = true;

            if ((room_map[x][y] & ) == ) stk.push(room(x, y - ));    //向西；

            if ((room_map[x][y] & ) == ) stk.push(room(x - , y));    // 向北；

            if ((room_map[x][y] & ) == ) stk.push(room(x, y + ));    //向东；

            if ((room_map[x][y] & ) == ) stk.push(room(x + , y));    //向南；

        }

    }

}

int main()

{

    int r, c;

    while (~scanf("%d%d", &r, &c))

    {

        for (int  i = ; i <= r; i++)

            for (int j = ; j <= c; j++)

                scanf("%d", &room_map[i][j]);

        memset(color, false, sizeof(color));

        maxRoomArea = ;

        RoomNum = ;

        for (int i = ; i <= r; i++)

            for (int j = ; j <= c; j++)

            {

                if (!color[i][j])

                {

                    RoomNum++;

                    RoomArea = ;

                    bfs(i, j);

                    maxRoomArea = max(maxRoomArea, RoomArea);

                }

            }

        printf("%d\n", RoomNum);

        printf("%d\n", maxRoomArea);

    }

    return ;

}