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, 17, ['J', '505', '9301', '6263', 'W', '901', '1441', '595', '7877', '4597', '409', 'j', 'Y', 'P', '4737', 'f', 'H', 'u', 'B', 'V', '6661', 'e']

Ex Output:
36626


Ex Input:
9, 16, ['8223', '3639', '9643', '4457', 'q', 'q', '8831', '3521', 'h', 'H', 'C', '3965', 'a', '1559', 'u', '9189', '5355', 'u', 'h', 'y', 'D', 'p', 'S']

Ex Output:
14713


Ex Input:
12, 16, ['723', 'Y', '8105', 'K', '7089', '5493', 'j', 'X', 'X', '8529', '1333', '6657', '9601', '3903', '2223', '4849', 'y', '2323', 'y', 'T', 'h', '1671', '8147', 'G', 'm', '291', 'Y', 'T']

Ex Output:

27233