Farmer John's farm was flooded in the most recent storm, a fact only aggravated by the information that his cows are deathly afraid of water. His insurance agency will only repay him, however, an amount depending on the size of the largest "lake" on his farm.

The farm is represented as a rectangular grid with N (1 ≤ N ≤ 100) rows and M (1 ≤ M ≤ 100) columns. Each cell in the grid is either dry or submerged, and exactly K (1 ≤ K ≤ N × M) of the cells are submerged. As one would expect, a lake has a central cell to which other cells connect by sharing a long edge (not a corner). Any cell that shares a long edge with the central cell or shares a long edge with any connected cell becomes a connected cell and is part of the lake.

* Line 1: Three space-separated integers: N, M, and K
* Lines 2..K+1: Line i+1 describes one submerged location with two space separated integers that are its row and column: R and C

* Line 1: The number of cells that the largest lake contains.　

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 using namespace std;

 int N,K,M,a,b,cot,best;

 int map[][];

 int mov[][]={,,,-,,,-,};

 bool can(int x,int y)/判断能否符合条件

 {

     if(x<||x>=N||y<||y>=K||!map[x][y])

     return false;

     return true;

 }

 void dfs(int x,int y)//深搜

 {

     int xx,yy,i;

     map[x][y]=;//标记走过

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

     {

         xx=x+mov[i][];

         yy=y+mov[i][];

         if(can(xx,yy))

         {

             cot++;

             dfs(xx,yy);

         }

     }

 }

 int main()

 {

     int i,j;

     while(scanf("%d%d%d",&N,&K,&M)!=EOF)

     {

         memset(map,,sizeof(map));

         for(i=;i<M;i++)

         {

             scanf("%d%d",&a,&b);

             map[a-][b-]=;

         }

         int sum=;

         best=;

         for(i=;i<N;i++)

         for(j=;j<K;j++)

         {

             cot=;

             if(map[i][j])

             {

                 dfs(i,j);

             }

             best=best>cot?best:cot;//更新最优解

         }

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

     }

 return ;

 }