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.

[[-135, -185], [-37, 19, -24, -175], [-152, -195], [-174, -91, -109, -131], [-159, 22, 12], [-168, -152]]
[-135, 19, -152, -91, 22, -152]

[[43, -158, 27, -169, -144, 35], [-73, -173]]
[43, -73]

[[62, 69, 38, -84], [-144, -128, 80, -53, 19, -146, -46], [-147, -10, 89, -33, -103, -119, -150], [-111, 67, 33, -66, 92], [36, -158, -15, -174, -106, -10], [77, 20, -113, 70, -79, -80], [-121, -32, -49, -42], [-193, -47, -170, 97, 16]]

[69, 80, 89, 92, 36, 77, -32, 97]