#include <iostream>
#include <string>
#include <queue>
#include <algorithm>

using namespace std;
#define X first
#define Y second

int borad[502][502]={0};
bool vis[502][502];

int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);


    
    int cnt=0;
    int max_num=0;
    int n,m;
    cin >> n >> m;
    for(int i=0; i<n; i++) {
        for(int j=0; j<m; j++) {
            cin >> borad[i][j];
        }
    }

    for(int i=0; i<n; i++) {
        for(int j=0; j<m; j++) {
            if(borad[i][j]==0 || vis[i][j]) continue;
            
            cnt++;
            vis[i][j]=1;
            queue<pair<int,int>> q;
            q.push({i,j});
            int area=0;
            while(!q.empty()) {
                area+=1;
                pair<int,int> cur=q.front();
                q.pop();
                for(int i=0; i<4; i++) {
                    int nx=cur.X+dx[i];
                    int ny=cur.Y+dy[i];

                    if(nx<0 || nx>=n || ny<0 || ny>=m) continue;
                    if(vis[nx][ny] || borad[nx][ny]!=1) continue;
                    vis[nx][ny]=1;
                    q.push({nx,ny});
                }
            }
            max_num=max(max_num,area);
        }
    }
    cout << cnt << '\n' << max_num;
}