#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int a[11][11];
int n, s,temp,work = 0;
bool b[11][11] = { 0 };//标记
void group(int i, int j,int s) {
if (i<1 || i>n || j > i || j < 1||b[i][j]==1)return;
if (a[i][j] == 0) { work=1;return; }
if (a[i][j] != s)return;
temp++;b[i][j] = 1;
group(i, j - 1, s);
group(i + 1, j, s);
group(i + 1, j + 1, s);
group(i, j + 1, s);
group(i - 1, j, s);
group(i - 1, j - 1, s);
}
int score()
{
int ans = 0;
for (int i = 1;i <= n;i++) {
for (int j = 1;j <= i;j++){
if (a[i][j] != 0&&b[i][j]==0) {
temp = 0;work = 0;
group(i, j, a[i][j]);
if (work == 1)temp = 0;
if (a[i][j] == s)ans -= temp;
else ans += temp;
}
}
}
memset(b, 0, sizeof(b));
return ans;
}
int main() {
while (cin >> n >> s) {
if (n == 0 && s == 0)break;
for (int i = 1;i <= n;i++) {
for (int j = 1;j <= i;j++) { cin >> a[i][j]; }
}
int max=-15;
for (int i = 1;i <= n;i++) {
for (int j = 1;j <= i;j++) {
if (a[i][j] == 0) {
a[i][j] = s;
int re = score();
a[i][j] = 0;
if (re > max)max = re;
}
}
}
cout << max << endl;
}
}