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, ['E', '6187', '5861', '3697', '2749', '1171', '6085', 'c', '2291', '2385', '7335', 'B']
Example Output: 12048

Example Input: 2, 8, ['r', 'H', 'K', 'K', '7307', 'i', '9381', '4175']
Example Output: 20863

Example Input: 7, 11, ['b', '1465', 'e', '5047', '5965', '6643', 'X', '9025', 'f', '8887', '6559', '6877', '4651', '4163', '845', '6031', '8105', 'o', 'e', 'Q', 'O', 't', '6111', 'J', '1721', 'p', '1755', 'G', '1135']
Example Output:
24471