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.

[[75, -168, -26, -170, -66, 46, -55], [-24, 95, -6], [-138, -147, 53, 1, -161, 70, -180], [7, 68, -48, -112, -121, -178, 44], [100, -87], [-95, -99, -2], [-90, -10, 15, -177, 6, -46], [-78, -99, -136, -41, 20, 32, -187], [-168, 97]]
[75, 95, 70, 68, 100, -2, 15, 32, 97]

[[-121, -195, -57], [44, 95, -149, -20, -116, -41], [-37, -154, -161, 65, 25, -112], [-186, -114, -1, -85], [54, 11, -124, 22, 100, 54], [-140, 55, -133, -35, -3], [-54, -158, -194, -191, 31], [94, -27, 78, -132, -132, 52, -170]]
[-57, 95, 65, -1, 100, 55, 31, 94]

[[47, 20, 9, 3, 83], [-154, 37, -59, -171], [43, -150, -35, -20, 100], [-119, -144, 10], [-159, -43], [39, 69, -74, -55, -38, 58]]

[83, 37, 100, 10, -43, 69]