执行以下代码后，输出结果为 2。

n, m = 3, 4
grid = [[1, 3, 2, 4],
        [5, 7, 6, 8],
        [9, 0, 1, 2]]
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
count = 0
for i in range(n):
    for j in range(m):
        lower_neighbors = 0
        for k in range(8):
            x, y = i + dx[k], j + dy[k]
            if 0 <= x < n and 0 <= y < m and grid[x][y] < grid[i][j]:
                lower_neighbors += 1
        if lower_neighbors >= 5:
            count += 1
print(count)