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.

[[-130, -20, -171, -122, 49, -43], [-173, -82, 17], [87, -55, -70, -113], [69, 10, -121, -177]]
[49, 17, 87, 69]

[[-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]

[[-151, -84], [76, -42, 40, 2, -57, 40, -120], [-161, -82, -172, -21, -60, -73, 47], [-47, -26, -120, 1, -142]]

[-84, 76, 47, 1]