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: 3, 4, ['2425', 'J', 'x', '8829', 't', '7927', 'R', 'J', '1599', '3149']

Output: 8829


Input: Consider Input: 6, 10, ['5601', '3783', '7919', '9195', 'G', 'J', 'L', 'X', 'O', 'F', '2479', 's', 'H', '5353', '7079', '2199', '2937', 'S']

Output: 0


Input: Consider Input: 6, 8, ['v', '4789', 'P', '5123', 'R', 'a', '7083', 'f', '7205']


Output: 7083