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.

Example Input: 1, 1, ['f', '6023', 'A', 'f', '4665', 'u', 'o', '7783', 'a', 'N', 'd', '7685', 'W', '9631', 'e', 'W', '1625', 'Q', 'B', '9097', '7613', 'L', '9929', '8469']
Example Output: 0

Example Input: 2, 16, ['v', 'd', '6599', 'd', '9305', '6377', '5009', '3797', '3861', '9421', 'G', 'N', 'm', 'x', 'E', '7047', 'W', '5629', 'j']
Example Output: 51416

Example Input: 5, 13, ['j', '647', '29', 't', 'C', 's', '6653', 'N', 't', '7011', '5947', '7631', 'a', 'C']
Example Output:
27242