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.
[[-141, -169, 22, 54, -196, 97, -40], [-160, -162, 51], [-44, -105], [69, -156, -175, 14], [59, -91, -52, -100], [-196, -163, -81, 71, -136], [79, -160], [-144, -179, -101], [-187, 20, -19, -148, 87]]