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, 6, ['j', 'j', 'W', '1351', 'B', 'e', '2585', '8831', '7465']

Ex Output:
1351


Ex Input:
2, 2, ['8023', '9385', '7533', 'd', 'H', '3751', 'A', '1399']

Ex Output:
9385


Ex Input:
1, 5, ['3561', '4511', '39', '525', '1463', '8275', '8885', '5601', '7857', 'N', 'U', '6635', 'C', 'h', 'W']

Ex Output:

10099