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:
14, 18, ['y', '4021', '9011', '3447', '6467', '5599', 'T', 'g', '1441', 'e', '2857', '7251', 'D', '619', '6413', '3145', '9355', 'O', 'Z', '6521', '5005', 'Q']

Ex Output:
19532


Ex Input:
2, 6, ['j', 'j', 'W', '1351', 'B', 'e', '2585', '8831', '7465']

Ex Output:
1351


Ex Input:
8, 12, ['E', 'f', '9369', '8645', 'E', 'H', '5329', 'm', 'a', '875', 'M', 'z', '1863', 'U', '1267']

Ex Output:

875