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.

[[18, 55, -103], [-91, 6, -103, 0, -140, -53, 94], [89, -82], [-134, 30, -157, -82, -41], [-52, 77, -163], [-122, -133, -98, 48, 87, -106, 37]]
[55, 94, 89, 30, 77, 87]

[[52, -128, -179, -149, 20, -143], [-174, -30, -84, -103, 39, -123, -85], [-52, 86, -77, 10, 58, -150, 95], [-165, -32, -190, -88, 2], [-21, -113, -67, -17, -39, -177], [-124, -40, 57], [73, -171, -187], [70, 37, 45, -160, -78], [-48, 44, -59, -75, -63, -77]]
[52, 39, 95, 2, -17, 57, 73, 70, 44]

[[-117, -1], [-4, 93, 81, -147], [-145, -175, -95, 20, -118, -159], [4, -114, -116, -198, 100, -66, 10], [-49, 8, 13, 50, 35, -192], [11, -29, 87, -85, 81, 5, -100], [85, 40, -59, -200, -85], [66, -32], [-68, -148, -2]]

[-1, 93, 20, 100, 50, 87, 85, 66, -2]