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, 3, ['b', '3997', '285', 'T']
Example Output: 4282

Example Input: 3, 15, ['l', '7213', '6849', '4327', 'V', 'S', '3773', '2583', 'f', '5031', 'J', '5263', 'w', '9777', '2753']
Example Output: 40356

Example Input: 4, 13, ['o', '8247', 'k', '4991', 'o', '5795', 'B', 'P', 'x', 'K', 'c', 'w', 'N', '7059', '5523', '1927', '1825', '2369', 'H']
Example Output:
10786