#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define N 1024
#define M 1024
int a[N][M], i=0, j=0, n , m, maxim, c, b, neg, minim;
int main()
{
    printf("Enter an amount of array's lines and columns\n");
    printf("n = ");
    scanf("%i/n", &n);
    printf("m = ");
    scanf("%i/n", &m);
    printf("Enter an array\n");
    for (i = 0; i < n; i++)
    {
        for ( j = 0; j < m; j++)
            scanf("%d", &(a[i][j]));
    }
    for (i = 0; i < n; i++)
    {
        for ( j = 0; j < m; j++)
        {
          printf("%d ", a[i][j]);
        }
        printf("\n");
    }
            //FINDING MAXIMUM (5)
    maxim =a [0][0];
    c = 0;
    b = 0;
    for (i=0; i<n; i++)
    {
        for (j = 0; j < m; j++)
        {
            if (a[i][j] > maxim)
            {
                maxim = a[i][j];
                c = i;
                b = j;
            }
        }
    }
    printf("Maximum element's index is [%i][%i] and it amounts %i\n", c, b, maxim);
            //FINDING MINIMUM (6)
    minim = a[0][0];
    c = 0;
    b = 0;
    for (i = 0; i < n; i++)
    {
        for (j = 0; j < m; j++)
        {
        if (a[i][j] < minim)
            {
                minim = a[i][j];
                c = i;
                b = j;
            }
        }
    }
    printf("Minimum element's index is [%i][%i] and it amounts %i\n", c, b, minim);
        //FINDING LAST NEGATIVE ELEMENT
    c = -1;
    b = -1;
    for ( i = n-1; i >= 0; i--)
    {
        for (j = m - 1; j >= 0; j--)
        {
            if (a[i][j] < 0)
            {
                neg = a[i][j];
                c = i;
                b = j;
            }
        }
    }
    if (c == -1 && b == -1)
        printf("There is no negative element\n");
    else
    {
        printf("The last negative element amounts %i and has index [%i][%i]\n", neg, c , b);
    }
    _getch();
    return 0;
}