In this task, you are given inputs i,j, and A, where i and j are integers and A is a list. You need to return the sum of all the numerical elements in the list A between the positions i and j (including positions i and j). Return 0 if no numerical element is present in the list between the given ranges. i and j will be non-negative, and will always have a value less than the length of A. i will always be less than j.
16, 21, ['o', '4281', '4569', 'a', 'y', '1519', '2061', '7293', '1595', 'b', '5151', 'M', 'e', 'P', 'G', '5401', 's', 'R', '7775', 'N', 'Y', 'H', '1291', '8805', '29', '4179', '5327', 'I', 'd']