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.
11, 19, ['3871', '9647', '4383', 'p', '1609', '3157', 'X', '1857', 'Y', '8555', 'Q', '605', 'Q', 'b', '8471', 'V', 'p', '3417', 'y']