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.
[[-121, 35, 15, -168, 65], [62, -41, 34, -126], [79, -176, -191], [-88, -39, -51, -146], [-148, -45, 88, 61, -151], [-23, -167, -149, -138, 72, -39], [-163, 90, 3, -124], [-36, -128, 2, -50, -91]]