/*
#include <stdio.h>
#include <stdlib.h>
int main()
{
printf("Hello world!\n");
return 0;
}
*/
/*
#include<string.h>
#include<stdio.h>
int map[105][105] = {0},count[1000] = {0},sum=0;
void find(int x,int y)
{
count[sum]++;
map[x][y] = 0;
if(map[x-1][y]==1)
{
find(x-1, y);
}
if(map[x+1][y]==1)
{
find(x+1, y);
}
if(map[x][y-1]==1)
{
find(x, y-1);
}
if(map[x][y+1]==1)
{
find(x, y+1);
}
if(map[x-1][y-1])
{
find(x-1, y-1);
}
if(map[x-1][y+1])
{
find(x-1, y+1);
}
if(map[x+1][y-1])
{
find(x+1, y-1);
}
if(map[x+1][y+1])
{
find(x+1,y+1);
}
}
int main()
{
int n,m,i,j;
scanf ("%d %d",&n,&m);
for(i=1; i<=m; i++)
{
for(j=1; j<=n; j++)
{
scanf (" %c",map[i][j]);
}
}
for(i=1; i<=m; i++)
{
for(j=1; j<=n; j++)
{
if(map[i][j]=='L')
{
find(i,j);
}
}
}
printf ("%d",sum);
return 0;
}
*/