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:
2, 2, ['M', 'I', 'G', '3747']

Ex Output:
0


Ex Input:
2, 9, ['S', 't', '243', '5691', '5695', 'Y', 'd', '8695', 'M', 'K', 'z', 'I', '7325', '8945', 'P', 'Q', 'I', 'N']

Ex Output:
20324


Ex Input:
6, 6, ['y', '2303', 'k', 'C', 'm', '6859', 'D', '8237', '6755', '6247', 'M', '8133', 'c', 'c', '3901']

Ex Output:

6859