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:
8, 9, ['P', 'V', '5567', 'm', 'V', '9533', '2381', '1095', '835', 'B', 'z', 'J', 'H', 't', 'b', 'z', 'e']

Ex Output:
1930


Ex Input:
4, 4, ['Y', 'X', 'r', '439', 'D', 'H', '1903']

Ex Output:
439


Ex Input:
6, 22, ['Y', 'c', 'Q', '2689', '5675', 'V', 'j', '9863', '1225', 'q', '4189', 'e', '3577', 'g', 'I', '8397', 'y', '5741', '6809', '2119', 'r', '5765', 'Z', 'M', '3209', 'N']

Ex Output:

47685