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.

[[-52, -181, 85, -185], [-188, 21], [-180, -20, 34, -164], [-161, -10, -15, 90], [81, -138, 63, -157, -175, -132], [-50, 31, -129, -101, -149, 32], [15, -108, -17, -54, 1, 77, -29], [-53, 65], [97, -33, 16]]
[85, 21, 34, 90, 81, 32, 77, 65, 97]

[[-134, -121, 72, 82, -12, -28], [67, 87, 98, -58, -57, 6, 84], [-46, 76, -179, 21, -132, -46], [12, -67, -19, -46], [-62, -22, 58, -139, -39, -118], [-5, -170, 85, -75, -126, 53, -63], [9, -82, 7], [-88, -111, -81, 86, -17, 36, -160]]
[82, 98, 76, 12, 58, 85, 9, 86]

[[-56, -24, 39, -101, -8], [-107, 52, -24], [-164, -6, -192, -34], [73, 51], [-169, 64, -133, -195, -89]]

[39, 52, -6, 73, 64]