m,num = map(int,input().split()) #这个矩阵是 方阵（行数与列数相等） a =[] for x in range(m): b = list( map(int,input().split() )) a.append(b) #i==j , i+j==m-1 #遍历所有元素 for i in range(m): for j in range(m): if i == j: a[i][j]= a[i][j]+num elif i+j == m-1: a[i][j] = a[i][j] + num for row in a: for ele in row: print( str(ele).rjust(5),end='') #r:right just:justify 对齐 print()