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.
[[28, -83, -54, -90, -137, 19, -28], [7, -81, 18, -115, -101, 38], [74, -196, -26, 73, 33], [46, -62, 41, -18, -104], [-91, -106, 53, -72, 26, 73, -185], [36, -190, 8, -51], [-155, -106]]