Definition: 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.
Input: 9, 16, ['X', '6953', '3079', '5677', 'B', 'Z', '1757', '5181', '3751', 'z', '7999', '7871', '9599', 'R', '793', 'j', '7917', '5939', 'M', '1681']

30013