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, 11, ['W', 'c', '8889', '2649', '6183', '1489', 't', 'o', '4925', '4411', 'b', '5657', 'i', 'q', 'z', 't']
Example Output: 28546

Example Input: 1, 2, ['j', '3613']
Example Output: 3613

Example Input: 1, 11, ['L', '8553', 'J', 'b', 'T', '3339', 'v', '9805', '5755', '197', '7695', 'Q', 'V']
Example Output:
35344