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.

[[89, -153, 6, 22], [-170, -13, -120, -83], [20, -54, -193, -101], [7, 92], [-25, 100, -154, -30, -135], [13, -180, -117, -107], [6, -165, -63, -95, -197, -190, -113], [-92, -160, 88, 9, -185, -178, -36], [-154, -176, -126, -4, 71]]
[89, -13, 20, 92, 100, 13, 6, 88, 71]

[[-22, -114, -146, 89, -169, -115], [85, -195, -162, -141, -15], [-144, -181, -104, 12, -10, 85, 37], [1, -65, -144, -42, -187]]
[89, 85, 85, 1]

[[-199, -66, 48], [46, -116, 5, 82], [-197, 11, 21, -99, 83, -123], [-74, -151], [52, -23, 9], [-176, -68, -4, -51, -144, 61]]

[48, 82, 83, -74, 52, 61]