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: 1, 10, ['9139', 'F', 'e', 'F', '8979', '831', '6811', '3677', '2937', '1001']

Output: 33375


Input: Consider Input: 4, 10, ['1081', 'm', 'm', '489', '9481', '5741', '1049', 'p', 'd', '7785', 'm', '4905', '1343', 'A', '9931', 'C', 'v', 'l']

Output: 24545


Input: Consider Input: 8, 14, ['x', 'H', '8115', '2797', '3875', 'n', '3329', '1055', '1713', '1763', '5015', 'H', '1251', '8623', 'r', 'z', 'b', '1071']


Output: 19420