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.
[[-190, -4, -146], [89, 62], [11, 93], [-19, -67, -157, 31, -190], [-123, -23], [-161, -7, 80, -187, -19, 19, 67], [-72, -10, 56], [-124, -144, -26, -128, -159, 73, -160], [-103, -81, -20, -60, 77, -165]]