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:
4, 4, ['Y', 'X', 'r', '439', 'D', 'H', '1903']

Ex Output:
439


Ex Input:
1, 6, ['8527', '3499', 'M', 'f', 'V', 'B']

Ex Output:
12026


Ex Input:
4, 17, ['7197', 'S', '2987', '6535', '3411', 'w', '7293', '4627', '8213', '7703', '4489', '3749', '5319', 'j', '9139', '7083', 'T']

Ex Output:

67561