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: 4, 7, ['7463', '6237', 'v', '9817', '969', '6317', 'N', 'k', '2023']
Example Output: 17103

Example Input: 11, 15, ['C', 'E', '9009', '9169', 'k', 'z', 'O', 'X', 'q', '2333', 's', 'H', '1145', 'a', '3773', '4701', '955', 'c', 'U', '3643', 'j', 'u', '5153', 'w', '721', 'S', 'I']
Example Output: 4918

Example Input: 7, 12, ['9161', 'r', 'Q', '3491', 'V', 's', '2211', '355', '245', '1351', 'x', '8079', '7419', 'O', 'V', 'h']
Example Output:
12241