Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint