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.

[[42, -42, -94, 25, -125], [-141, -138, -170, -87, -121]]
[42, -87]

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

[[51, -180, -99, -114, 40, 22, 92], [-70, -31, -121, -103, -143, -79], [95, 88, -167, -111, -177, -43, -44], [-41, -122, 22], [-15, -31, 94, -34, 68, -17], [89, 57, -163, -20]]

[92, -31, 95, 22, 94, 89]