public static void Main()
Console.WriteLine("Percaktoni sa rreshta do te kete matrica ");
int row = int.Parse(Console.ReadLine());
Console.WriteLine("Percaktoni sa kolona do te kete matrica");
int col= int.Parse(Console.ReadLine());
int[,] matrix = new int[row,col];
static void TeDhena(int[,] matrix){
Console.WriteLine("Jepni elementet e matrices " +matrix.Length);
for(int i=0;i<matrix.GetLength(0);i++){
for(int j=0; j<matrix.GetLength(1);j++){
Console.WriteLine("Matrica[{0},{1}] = " , i , j);
matrix[i,j]= int.Parse(Console.ReadLine());
for (int row = 0; row < matrix.GetLength(0); row++)
for (int col = 0; col < matrix.GetLength(1); col++)
Console.Write(" " + matrix[row, col]);
static void calculate(int[,] matrix){
long bestsum= long.MinValue ;
for(int rows = 0 ; rows < matrix.GetLength(0) - 1 ; rows++){
for(int cols= 0 ; cols < matrix.GetLength(1) - 1 ; cols++){
long sum = matrix[rows,cols] + matrix[rows,cols + 1] + matrix[rows ,cols + 2] + matrix[rows + 1,cols] +matrix[rows + 1,cols + 1]+matrix[rows + 1,cols + 2] +matrix[rows + 2,cols]+matrix[rows + 2,cols + 1] + matrix[rows + 2,cols + 2];
Console.WriteLine("Treshja me e mire e matrices eshte ");
Console.WriteLine("{0} ,{1} " , matrix[bestRow,bestCol],matrix[bestRow,bestCol+1],matrix[bestRow,bestCol+2]);
Console.WriteLine("{0} ,{1} " , matrix[bestRow+1,bestCol],matrix[bestRow+1,bestCol+1],matrix[bestRow+1,bestCol+2]);
Console.WriteLine("{0} ,{1} " , matrix[bestRow+2,bestCol],matrix[bestRow+2,bestCol+1],matrix[bestRow+2,bestCol+2]);
Console.WriteLine("shuma maksimale eshte " ,bestsum);