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: 1, 3, ['7641', '5147', '995', 's', '6697']

Output: 13783


Input: Consider Input: 7, 21, ['I', 'J', 'X', '5493', 'Q', '7455', 'S', '4743', 'h', 'E', 'O', 'd', '4923', 'M', 'M', 'U', 'Y', '855', 'C', 'P', '9445', '811', 'g', 'x', 'u', '9809', 'j']


Output: 19966