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.

Input: Consider Input: 5, 15, ['5049', '2581', '4617', 'b', 'c', 'z', '8247', 'd', '1413', '7797', 'K', 'T', '9009', 'V', '5179', '1643', '3923', '4885', 'j', '6717', 'D', 'D', 'O', '5777', 'W', 'J', '6267', 'e']

Output: 31645


Input: Consider Input: 2, 7, ['C', 'C', '9639', '7815', 'N', '1713', '8339', '4237']

Output: 27506


Input: Consider Input: 3, 3, ['t', 'L', '1943', 'G', 'Q', 'I', 'K', 'V', 'B', 'o', '539', '4495', 'i', '2511', 'N', 'c', '9937', '9937', 'J', 'w', '4979', '9697']


Output: 1943