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.

[[35, -126], [-21, 82, -21], [-175, -59, -200, 27], [50, 6, -137, 58, -71, -30, -91], [-103, -132]]
[35, 82, 27, 58, -103]

[[-42, -149, -6, -115, -152], [-59, -75], [-178, -94, 49, -51, 52], [-51, 7, -146, -101, -191, 14], [-132, -103, 96, -126, -195, 80], [37, 19, -145, -23, -109], [-109, -125, 47, 36, 6, -123, 62]]
[-6, -59, 52, 14, 96, 37, 62]

[[-153, 73, -153, -169, 8, -22, -188], [-46, -140], [81, -6, -44, -143, -162, -29, 100], [-190, 91, -190], [-101, -109, 43, -136, -62, -44, -139]]

[73, -46, 100, 91, 43]