In this task, you are given a list. This list contains many lists of integers. The list is several items written within a []. Your task is to find the maximum number among the members of each inner list. The output should be a list comprised of the maximums with the same order as the internal lists.

[[-96, 57, -186, 28, -171], [80, 54], [-20, -187], [-50, -169], [-13, 8, -129, -76, -46], [-119, 64, -170]]
[57, 80, -20, -50, 8, 64]

[[-100, -195, -66], [-6, -45, -30, -34, -43], [91, -127, -170, 11], [-127, 69, -126, -88], [-195, -24, -70, -91], [72, -1, -139, -122, -189]]
[-66, -6, 91, 69, -24, 72]

[[-71, -63, -99], [-27, -61, 12, 57, 22, -182], [-176, -98, -91], [25, 79, -56, -110, -180], [69, -47, -145, -197], [-33, 97, 37, 43, -154], [-86, -6, 78, -96, -116, 85], [59, -15, -60, -143, 97, -12, -126], [-45, -141]]

[-63, 57, -91, 79, 69, 97, 85, 97, -45]