Заполнить матрицу числами, равными количеству элементов, соседних с данным

def f(n,m,a):
    r=0
    mm = ((n-1 >= 0) and (m-1 >= 0))
    om = (m-1 >= 0)
    pm = ((n+1 <= (len(a)-1)) and (m-1 >= 0))
    mo = (n-1 >= 0)
    po = (n+1 <= (len(a)-1))
    mp = ((n-1 >= 0) and (m+1 <= (len(a[n])-1)))
    op = (m+1 <= (len(a[n])-1))
    pp = ((n+1 <= (len(a)-1)) and (m+1 <= (len(a[n])-1)))
 
    if mm:
        r+=a[n-1][m-1]
    if om:
        r+=a[n][m-1]
    if pm:
        r+=a[n+1][m-1]
    if mo:
        r+=a[n-1][m]
    if po:
        r+=a[n+1][m]
    if mp:
        r+=a[n-1][m+1]
    if op:
        r+=a[n][m+1]
    if pp:
        r+=a[n+1][m+1]
 
    return r
        
n,m=int(input()),int(input())
k=[[1 for _ in range(m)] for _ in range(n)]
res=[[] for _ in range(n)]
for i in range(n):
    for j in range(m):
        res[i].append(f(i,j,k))
for i in res:
    print(*i,end='\n')

n=5
m=3
n0=[0,n-1]
m0=[0,m-1]
A=[[8 for i  in range(m)] for j in range(n)]
for i  in   n0:
    for j in range(m):
        A[i][j]=5
for i in range(n):
    for j in  m0:
        A[i][j]=5
A[0][0]=A[0][m-1]=A[n-1][0]=A[n-1][m-1]=3
print(A)

2
1
[3]
[3]
>>>

i%(m-1) + j%(n-1) == 0

i*j*(i-m+1)*(j-n+1) == 0