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: 4, 4, ['Y', 'X', 'r', '439', 'D', 'H', '1903']
Example Output: 439

Example Input: 4, 12, ['E', '6343', 'f', '541', '7361', '9993', 'g', '3185', 's', 'w', 'Q', 'I', 'e', 's']
Example Output: 21080

Example Input: 5, 10, ['r', '2243', 'Q', 'b', 'K', 'p', '2639', 'X', 'y', '685']
Example Output:
3324