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:
12, 19, ['x', 'Z', 'm', '3819', 'D', 'P', '4815', 'D', 'V', '1409', 'u', 'N', 'E', 'A', 'v', 'k', '553', '1869', '6203', '803', '4061']

Ex Output:
8625


Ex Input:
5, 11, ['9535', 'L', '5957', 'm', 'B', 'W', '2105', '4959', 'f', '395', 'a', 'W', 'C']

Ex Output:
7459


Ex Input:
17, 20, ['901', 'O', '7047', '1351', '8625', 'F', '5495', 'N', 'U', '6571', '1077', 'k', 'H', 'a', '1547', '6207', 'A', '1297', '3433', 'G', '2415', 'C', 'Y']

Ex Output:

4730