def lowerCamelCase  (   SCREAMING_SNAKE_CASE  ,			SCREAMING_SNAKE_CASE  ,			SCREAMING_SNAKE_CASE = 0  ,			SCREAMING_SNAKE_CASE = 0	):
    '''simple docstring'''







    __UpperCamelCase     :List[Any]			  =		right or len(SCREAMING_SNAKE_CASE	) - 1
    if left > right:
        return -1
    elif list_data[left] == key:
        return left
    elif list_data[right] == key:
        return right
    else:
        return search(SCREAMING_SNAKE_CASE  ,			SCREAMING_SNAKE_CASE  ,			left + 1  ,			right - 1	)


if __name__ == "__main__":
    import doctest

    doctest.testmod()






from __future__ import annotations

from PIL import Image

# Define glider example
__lowercase							 =					[
    [0, 1, 0, 0, 0, 0, 0, 0],
    [0, 0, 1, 0, 0, 0, 0, 0],
    [1, 1, 1, 0, 0, 0, 0, 0],
    [0, 0, 0, 0, 0, 0, 0, 0],
    [0, 0, 0, 0, 0, 0, 0, 0],
    [0, 0, 0, 0, 0, 0, 0, 0],
    [0, 0, 0, 0, 0, 0, 0, 0],
    [0, 0, 0, 0, 0, 0, 0, 0],
]

# Define blinker example
__lowercase							 =					[[0, 1, 0], [0, 1, 0], [0, 1, 0]]



def lowerCamelCase  (   SCREAMING_SNAKE_CASE	):
    '''simple docstring'''







    __UpperCamelCase     :int			  =		[]
    for i in range(len(SCREAMING_SNAKE_CASE	)	):
        __UpperCamelCase     :Dict			  =		[]
        for j in range(len(cells[i]	)	):
            # Get the number of live neighbours
            __UpperCamelCase     :List[str]			  =		0
            if i > 0 and j > 0:
                neighbour_count += cells[i - 1][j - 1]
            if i > 0:
                neighbour_count += cells[i - 1][j]
            if i > 0 and j < len(cells[i]	) - 1:
                neighbour_count += cells[i - 1][j + 1]
            if j > 0:
                neighbour_count += cells[i][j - 1]
            if j < len(cells[i]	) - 1:
                neighbour_count += cells[i][j + 1]
            if i < len(SCREAMING_SNAKE_CASE	) - 1 and j > 0:
                neighbour_count += cells[i + 1][j - 1]
            if i < len(SCREAMING_SNAKE_CASE	) - 1:
                neighbour_count += cells[i + 1][j]
            if i < len(SCREAMING_SNAKE_CASE	) - 1 and j < len(cells[i]	) - 1:
                neighbour_count += cells[i + 1][j + 1]

            # Rules of the game of life (excerpt from Wikipedia):
            # 1. Any live cell with two or three live neighbours survives.
            # 2. Any dead cell with three live neighbours becomes a live cell.
            # 3. All other live cells die in the next generation.
            #    Similarly, all other dead cells stay dead.
            __UpperCamelCase     :List[str]			  =		cells[i][j] == 1
            if (
                (alive and 2 <= neighbour_count <= 3)
                or not alive
                and neighbour_count == 3
            ):
                next_generation_row.append(1	)
            else:
                next_generation_row.append(0	)

        next_generation.append(SCREAMING_SNAKE_CASE	)
    return next_generation



def lowerCamelCase  (   SCREAMING_SNAKE_CASE  ,			SCREAMING_SNAKE_CASE	):
    '''simple docstring'''







    __UpperCamelCase     :Optional[Any]			  =		[]
    for _ in range(SCREAMING_SNAKE_CASE	):
        # Create output image
        __UpperCamelCase     :Dict			  =		Image.new('''RGB'''  ,			(len(cells[0]	), len(SCREAMING_SNAKE_CASE	))	)
        __UpperCamelCase     :Any			  =		img.load()

        # Save cells to image
        for x in range(len(SCREAMING_SNAKE_CASE	)	):
            for y in range(len(cells[0]	)	):
                __UpperCamelCase     :Optional[Any]			  =		255 - cells[y][x] * 255
                __UpperCamelCase     :int			  =		(colour, colour, colour)

        # Save image
        images.append(SCREAMING_SNAKE_CASE	)
        __UpperCamelCase     :Optional[int]			  =		new_generation(SCREAMING_SNAKE_CASE	)
    return images


if __name__ == "__main__":
    __lowercase							 =					generate_images(GLIDER, 16)
    images[0].save('''out.gif''', save_all=True, append_images=images[1:])





