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.

[[-70, -63, 11, -65, -62], [41, -3, -20, -154, -13, 32, -116], [30, 90, -122, 12, 33], [72, -18, -151, -20, -177], [-85, 34, -87, 6, 20], [56, -153, -117, -101], [-59, 91, -123, -28, -60, -134], [-186, -162, -133]]
[11, 41, 90, 72, 34, 56, 91, -133]

[[-20, -187], [-50, -191], [-69, -155, -10, -152, -72, 86], [53, -172, -84, 95]]
[-20, -50, 86, 95]

[[-1, 14, -161, 75], [-141, -99, -85], [-134, -8, -151, 30], [-141, 12, -39, -5, -158, 46], [-36, -89, 68, -77, 37, -178, -58], [-186, -157, 87, -37], [-111, 68]]

[75, -85, 30, 46, 68, 87, 68]