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.

Ex Input:
1, 7, ['7999', '9549', '8299', 't', '9311', '2385', 'B', 'x', '565', 'C', '6531', 'A', '5949', 'H']

Ex Output:
37543


Ex Input:
6, 27, ['O', '4985', '525', 'U', 'B', '4689', 'u', '2891', 'A', 'O', 'u', 'T', 'Z', '81', '9747', 'O', '2135', 'U', '8637', '3927', 'X', 'z', 'W', 'h', '6347', 'L', 'c', 'H', 'q']

Ex Output:
38454


Ex Input:
9, 15, ['e', 'E', '5519', '4999', 'Z', 'b', '8569', '607', '8011', 'C', '5857', '4267', 'X', '1317', 'K', '5807', 'c', 'z', 'A', 'm', '4741', 'D', '855', 'L']

Ex Output:

19452