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.

[[-200, -120, -174, -82, -148, -12], [-40, 8], [76, 24, 48, -1, -89, -107], [96, -88, -195, 58, -136, 17], [-176, -36, -147, -183, -86, -70]]
[-12, 8, 76, 96, -36]

[[-42, -152, -122, -79], [-85, 39, 36, -53], [83, 52], [-31, -2, -176, -152, -107, 44, 62], [10, -163, -16], [44, 33, 55, -59, 1, -30, -19]]
[-42, 39, 83, 62, 10, 55]

[[-138, -80, -89, 36, -175, -44], [-17, -125, -110, 21, -115, -155, -10], [-18, 72, -129, -38, 14, -32, -18], [-158, -92, -36]]

[36, 21, 72, -36]