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, 9, ['5655', '7555', 'T', '3387', 'G', '9547', 'Z', '8679', '1561', 'E', '469']
Example Output: 30729

Example Input: 2, 3, ['3335', '3451', 'f', 'M']
Example Output: 3451

Example Input: 1, 9, ['5477', '4341', 'i', '333', 'W', 'U', '6439', '2081', 'G', 'V', 'i', 'Q', '3007', 'C', '7005', 'V', '5221']
Example Output:
18671