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.

[[-109, -49, -71, -4], [37, 18, -37, -47, 21, 0, -43], [90, -154], [33, 60, -7, -153], [-46, 9, 52, -84, 30, 55], [53, 14], [83, 72, 56, -46]]
[-4, 37, 90, 60, 55, 53, 83]

[[-171, -189, -135, -121], [-84, 53, -190, -121, 80], [-5, -124, 98], [-99, 55, -157, 56, -18, -141, -178], [-17, -34, -82, -186], [-134, 10], [55, -124, -200, -24, -77]]
[-121, 80, 98, 56, -17, 10, 55]

[[-92, -10, -166, -58, -25, -138, 100], [20, 95, -94, -187, -138, -170], [12, 38, 64, -19, -11, 4], [56, -132, -168, -6, -184, 51], [-36, -163, -200, 72, -22, 68, 18]]

[100, 95, 64, 56, 72]