matrixhopper problem

Question

suppose u create a matrix of m x n size where (it can be m=n and m>n and m<n) now lets suppose user enters 9 which is according to the user entered matrix at (1,1) position like (i,j) coordination rule .U have to display all the neighbouring numbers at a distance of one hop i.e at one hop u can get to those numbers in the matrix taking (1,1) suppose (as of this assumption) as origin.. ///BONUS ...find numbers at 2 hop distance too..............

Answer 1

Do diagonal elements have to be displayed?

Answer 2

It looks like it's a problem code from a website and you want it's solution.