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:
3, 4, ['2977', 'i', 'l', 'r', '8835', '7697', 'p', '1685', 'h', 'N', 'Z', '8661', '6003', '7007', 'D', 'C']

Ex Output:
0


Ex Input:
1, 3, ['e', '1703', 'x', 'U', '873']

Ex Output:
1703


Ex Input:
9, 26, ['4421', 'f', '9187', 'f', '5511', '6579', '6535', 'd', 'L', 'U', '5935', '179', '1063', 'A', '2617', '7879', '943', 'e', 'S', 's', '5045', '7977', 'z', '7051', '3669', '1171', 'h', 'x', 'r', '697']

Ex Output:

43529