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.

[[0, -183, -46, -46, -108], [-131, -150], [-93, 75, 9, 47, -33, 54, 16], [-77, -63, 29, 100, -186, -95, -84], [-115, -140, 73, -191, -117, 90], [-165, 95, 31, -180, -104, -180], [-173, -24], [13, -54, -180, -25, -46, -42], [-96, -133, 10, -61, -74]]
[0, -131, 75, 100, 90, 95, -24, 13, 10]

[[-51, -92, -181, -134, 56, -85], [-87, -90, -147], [97, -178, -18, -191, -55, -164], [5, -145], [37, 67, 75, -112, -191, 34], [100, 17], [-165, 4, 39, -184, -136], [-94, 22, -33, 24, -13, 38]]
[56, -87, 97, 5, 75, 100, 39, 38]

[[66, -125, -2, 80, -197, -102], [11, -34, 10], [-16, -186], [53, -40, -56, -199, -162], [70, -189], [-171, -149, -145, 20, -194, 55], [-38, 78, -68]]

[80, 11, -16, 53, 70, 55, 78]