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.

[[-160, -157, 75, 3, -119, 14, -70], [-156, 70, 10, 21], [-86, 47], [-52, 80, 87, 26, -100, 48], [-36, -127, 37, -1, -59, -26, 8], [72, 48], [-200, -178, -142, -12], [-5, -61], [76, -54, -134]]
[75, 70, 47, 87, 37, 72, -12, -5, 76]

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

[[-75, -134, 79, -118], [21, -185, -104, -89], [-113, -9, 38, 95, -155, -100, 65], [-46, -22, -52, 51], [-95, -53, 95, 34, 98, -66], [-159, 10, -85, -120], [-78, 100, -4, -74, -28, -29]]

[79, 21, 95, 51, 98, 10, 100]