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:
10, 11, ['J', '5319', '1625', 'z', '275', 'B', '6901', 'b', 'X', '8669', '2307', '3117', 'K']

Ex Output:
10976


Ex Input:
6, 7, ['1595', '1523', '157', 'I', '3929', '6313', 'H', 'f', 'e', '93', '5625', 'b', 'J', 'b', '1185', '1505', 'I', 'y', '4043']

Ex Output:
6313


Ex Input:
1, 2, ['Z', '4397', 'G']

Ex Output:

4397