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: 8, 9, ['P', 'V', '5567', 'm', 'V', '9533', '2381', '1095', '835', 'B', 'z', 'J', 'H', 't', 'b', 'z', 'e']

Output: 1930


Input: Consider Input: 7, 12, ['273', 'h', '2433', '7155', '731', '5459', 'q', 'G', 'i', 'l', '3981', 'W', 'V', '4999', '8191', 'K', '8393', '9255']

Output: 3981


Input: Consider Input: 2, 6, ['2231', '4307', '3861', '767', 'P', '2831', 'V', '2729', '7461', 'N', 'H', 'X']


Output: 11766