int minI = 0, minJ = 0, min = a[0][0];
        int maxI = 0, maxJ = 0, max = a[0][0];
        for (int i = 0; i < n; i++)
            for (int j = 0; j < m; j++) {
                if (a[i][j] < min){
                    minI = i;
                    minJ = j;
                    min = a[i][j];
                }
                if (a[i][j] > max){
                    maxI = i;
                    maxJ = j;
                    max = a[i][j];
                }
            }