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.
[[-98, -169, -31, 57, 88, -9, -162], [11, -6, -31, 20, -191], [-35, -50, 27, -100, -131, -32, -39], [-21, -78, -60, -121, -88, -88, 38], [-151, 72, 70], [14, -137, -67], [-61, 28, -37], [-60, 0], [25, -126, 39, -171]]