1
#include<bits/stdc++.h>
2

3
using namespace std;
4
const int N = 2100;
5
int M[N][N];
6
int zhuan[N][N];
7
int n, m;
8
int h[N][N], l[N][N], r[N][N];
9
int main()
10
{
11
//   freopen("in.in", "r", stdin);
12
//   freopen("out.out", "w", stdout);
13
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
14
  cin >> n >> m;
15
  for(int i = 1;i <= n;i++)
16
  {
17
    for(int j = 1;j <= m;j++)
18
    {
19
      cin >> M[i][j];
20
      h[i][j] = 1;
21
      l[i][j] = r[i][j] = j;
22
    }
23
  }
24

25
  for(int i = 2;i <= n;i++)
26
  {
27
    for(int j = 1;j <= m;j++)
28
    {
29
      if(M[i - 1][j] != M[i][j])
30
      {
31
        h[i][j] = h[i - 1][j] + 1;
32
      }
33
    }
34
  }
35

36
  for(int i = 1;i <= n;i++)
37
  {
38
    for(int j = 2;j <= m;j++)
39
    {
40
      if(M[i][j - 1] != M[i][j])
41
      {
42
        l[i][j] = l[i][j - 1];
43
      }
44
    }
45
  }
46

47
  for(int i = 1;i <= n;i++)
48
  {
49
    for(int j = m - 1;j >= 1;j--)
50
    {
51
      if(M[i][j + 1] != M[i][j])
52
      {
53
        r[i][j] = r[i][j + 1];
54
      }
55
    }
56
  }
57
  int maxsquare = 0;
58
  int maxlen = 0;
59
  for(int i = 1;i <= n;i++)
60
  {
61
    for(int j = 1;j <= m;j++)
62
    {
63
      if(M[i - 1][j] != M[i][j])
64
      {
65
        if(i == 1) continue;
66
        l[i][j] = max(l[i][j], l[i - 1][j]);
67
        r[i][j] = min(r[i][j], r[i - 1][j]);
68
      }
69

70
      int b = min(r[i][j] - l[i][j] + 1, h[i][j]);
71
      maxlen = max(maxlen, b * b);
72
      maxsquare = max(maxsquare, (r[i][j] - l[i][j] + 1) * h[i][j]);
73
    }
74
  }
75
  cout << maxlen << endl;
76
  cout << maxsquare << endl;
77

78
  return 0;
79
}