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, 5, ['9615', '7859', 'D', 'J', '1471']
Example Output: 9330

Example Input: 1, 1, ['D', 'W', '5783']
Example Output: 0

Example Input: 7, 24, ['g', '3667', 'T', '6863', 'B', '6439', 'l', 'e', 'a', 'k', '3293', 'r', 'M', 'z', 'z', '8575', 'h', '2729', 'c', 'M', 'N', '6893', 'o', '3241', 'F', '7881', 'y', 'z']
Example Output:
24731