#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#define N 8
int mainfunc(char arr[][N], int SHUROT, int AMUDOT, char mila[]);
int godel(char str1[]);
int LineSerch(char arr2[][N], int shura, int amuda, char mila1[], int size1);
int ColumnSerch(char arr3[][N], int shura2, int amuda2, char mila2[], int size2);
int Serch(char arr4[][N], int shura3, int amuda3, char mila3[], int size3);
int main()
{
	int G;
	char array[][N] = { { "cbcewzca" }, { "ahdfyihb" }, { "chmochmo" }, { "ghioedoc" }};
	char mila1[] = "chmo";
	G = mainfunc(array, 4, 8, mila1);
	printf("%d\n", G);
	return 0;
}

int mainfunc(char arr[][N], int SHUROT, int AMUDOT, char mila[])
{
	int R = 0, B;
	B = godel(mila);
	R += LineSerch(arr, SHUROT, AMUDOT, mila, B);
	R += ColumnSerch(arr, SHUROT, AMUDOT, mila, B);
	R += Serch(arr, SHUROT, AMUDOT, mila, B);
	return R;
}

int godel(char str1[])
{
	int P = 0;
	while (str1[P] != '\0')
	{
		P++;
	}
	return P;
}

int LineSerch(char arr2[][N], int shura, int amuda, char mila1[], int size1)
{
	int i, j, l, sum, count = 0;
	for (i = 0; i < shura; i++)
	{
		for (j = 0; j < amuda; j++)
		{

			if (arr2[i][j] == mila1[0])
			{
				sum = 1;
				l = 1;
				while (j + l < amuda)
				{
					if (mila1[l] == arr2[i][j + l])
						sum++;
					l++;
				}
				if (sum == size1)
					count++;
			}
		}
	}
	return count;
}

int ColumnSerch(char arr3[][N], int shura2, int amuda2, char mila2[], int size2)
{
	int i, j, l, sum, count = 0;
	for (j = 0; j < amuda2; j++)
	{
		for (i = 0; i < shura2; i++)
		{
			if (arr3[i][j] == mila2[0])
			{
				sum = 1;
				l=1;
				while (i + l < amuda2)
				{
					if (mila2[l] == arr3[i + l][j])
						sum++;
					l++;
						if (sum == size2)
						{
							count++;
							l = amuda2;
						}
				}

			}
		}
	}
	return count;
}

int Serch(char arr4[][N], int shura3, int amuda3, char mila3[], int size3)
{
	int i, j, l, sum, count = 0;
	for (i = 0; i < shura3; i++)
	{
		for (j = 0; j < amuda3; j++)
		{

			if (arr4[i][j] == mila3[0])
			{
				sum = 1;
				l = 1;
				while ((j + l<amuda3) && (i + l<amuda3))
				{
						if (mila3[l] == arr4[i + l][j + l])
							sum++;
						l++;
						if (sum == size3)
						{
							count++;
							l = amuda3;
						}
				}

			}
		}
	}
	return count;
}