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: 5, 6, ['x', 't', '9767', '4787', 'T', 'e', 'Y', '8919']
Example Output: 0

Example Input: 3, 7, ['1687', '1929', '3189', '3277', 'L', 'b', 'x', '3181', 'C', 'w', 'A', 't', 'I', '3421']
Example Output: 6466

Example Input: 16, 16, ['4855', 'x', '6889', 'L', 'D', 'K', 'l', 'k', 'V', 'q', 'M', '8173', '1253', '3587', '4387', '2913', 'U', 'E', '7527', 'I', 'F']
Example Output:
2913