#include <stdio.h>
#include <conio.h>


void main ()
{
	int N, M, i, j, A[15][15], S=0;
    printf ("vvedite N i M\n");
    scanf ("%d % d", &N, &M);
	printf ("vvedite matrizu\n");
       for (i = 1; i <= N; i++)
             for (j = 1; j<=M; j++)
                scanf ("%d", &A[i][j]);

	//*printf ("vvedite i i j\n");
	//*scanf ("%d %d", &i, &j);

	printf("\n i\t j\t summa\n");
for (i = 1; i <= N; i++)
for (j = 1; j <=M; j++)
{
S=obrabotka(i,j,N,M,A, S);

printf ("%d\t%d\t%d\n",i, j, S); }
getch();

	}




  int  obrabotka (int i, int j, int N, int M, int A[15][15], int S)
 {
  int ii, jj, j1, B[10];

  int n=1;

   if ((i+1) <= N)
	 { for (j1=1; j1 <= M; j1++)
			 {
		 B[n]=A[i+1][j1];
		 n++;
            }
       for (jj=j, ii=i; jj<=M, ii>=1; jj++,ii--)
         {
			B[n]=A[ii][jj];
			n++;
				   }
	   for (jj=j, ii=i; jj>=1, ii>=1; jj--, ii--)
					 {
            B[n]=A[ii][jj];
			n++;
				   }
						   }

   for (n=1;n<=(n-1);n++)
   if (B[n]%B[n]/2==0)
		 {
		 S=S+B[n];

			  }
return S;