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.

[[-35, -168], [73, -23, -44, -109], [-90, 58, -47, 56], [-27, -102, -149, -183, 72]]
[-35, 73, 58, 72]

[[-56, -179, -2, -94], [-5, 31, -137, -128], [-53, -151, -60, 57, -3], [-73, 0, -54, -128], [6, -74, 55, -90], [94, -128, 94, 44, -189, -38], [-167, -129, -11, 49, -60, -66], [-123, -3, 57, -159], [-120, -178, -46, -190, -26, 9, -8]]
[-2, 31, 57, 0, 55, 94, 49, 57, 9]

[[5, -118, -34, 96, -26, -142], [-160, -95, -32, 73, 35, -72], [-101, 80, -65, -123], [-120, 56, -66], [-124, 80], [15, -136, 26, -133, 10, 54, -26], [-60, -36, 10, -39, -76, 40, -116], [12, -69, -195, 51, 31], [-115, -79]]

[96, 73, 80, 56, 80, 54, 40, 51, -79]