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:
8, 13, ['6413', 'n', 'z', 'T', 'R', 'Y', 'D', 'W', 'L', '521', '3411', 'B', 'O', '6757']

Ex Output:
3932


Ex Input:
10, 11, ['J', '5319', '1625', 'z', '275', 'B', '6901', 'b', 'X', '8669', '2307', '3117', 'K']

Ex Output:
10976


Ex Input:
11, 14, ['4117', 'n', 'f', 'h', '5033', '4657', 'R', '2855', 'E', 'G', 'd', '4115', 'B', '1397', '6095', '7653', 't', '7727']

Ex Output:

5512