def search_hourglasses(arr):
    i = len(arr)
    j = len(arr[0])

    if i < 2 or j < 2:
        return 0

    check_point = []
    sum_hourglasses = []
    for m in range(i - 2):
        for n in range(j - 2):
            tmp = arr[m][n] + arr[m][n+1] + arr[m][n+2] + arr[m+1][n+1] + arr[m+2][n] + arr[m+2][n+1] + arr[m+2][n+2]
            sum_hourglasses.append(tmp)
    return max(sum_hourglasses)