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:
1, 1, ['D', 'W', '5783']

Ex Output:
0


Ex Input:
4, 5, ['t', '9215', 'K', 'Q', 'w']

Ex Output:
0


Ex Input:
13, 16, ['k', '4897', '9827', '5663', '77', 'Z', 'Z', '8259', '9243', '5905', '6493', 'I', 'U', '9807', 'R', '291', '2473', 'V', 'w', '5715', 'h', 'v', 'k']

Ex Output:

10098