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.

Ex Input:
6, 11, ['m', '455', 'u', 'C', 'b', 'N', 'A', 'W', 'M', '3811', 'K', '657', 's', '2839', 'E', 'E', '2733', '6733', 'c', 'P', 'V']

Ex Output:
3811


Ex Input:
1, 10, ['9139', 'F', 'e', 'F', '8979', '831', '6811', '3677', '2937', '1001']

Ex Output:
33375


Ex Input:
27, 29, ['L', '8521', 'A', 'Z', '3535', 'a', 'n', 'n', 'B', 'Z', 'T', '7559', 'o', '8339', 's', '3417', '6309', '3033', '7071', '5197', '7105', '6709', 't', 'V', 'o', 'J', '7849', 'X', 'Q', 'B']

Ex Output:

7849