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:
6, 7, ['6635', '1537', 'F', 'h', '7965', 'K', '5231', 'K', '3089']

Ex Output:
5231


Ex Input:
15, 20, ['o', '7647', 'E', '5963', 'Y', 'B', 'F', 'v', '9553', 'h', 'B', 'L', '8709', '5253', '9337', 'r', '6107', '3099', '8217', '7597', '9571', '5453', '8367']

Ex Output:
34357


Ex Input:
4, 19, ['8161', 'A', '6035', 'r', '5561', '4935', '3597', '5995', '7617', 'W', '193', 'y', '3733', 'A', '8079', 'd', '6619', '4807', '5285', 'K', 'p', 'g', 'N', '871', '6629', 'f']

Ex Output:

56421