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: 2, 8, ['r', 'H', 'K', 'K', '7307', 'i', '9381', '4175']
Example Output: 20863

Example Input: 1, 11, ['W', 'c', '8889', '2649', '6183', '1489', 't', 'o', '4925', '4411', 'b', '5657', 'i', 'q', 'z', 't']
Example Output: 28546

Example Input: 3, 15, ['6489', 'z', '1631', 'G', '121', '1419', '813', 'c', 'p', 'a', '6359', 'x', '8031', 'h', 'L', '1951', '9441']
Example Output:
18374