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:
15, 23, ['z', '4587', '8709', '977', 'J', '823', '6437', '3817', 'X', '399', '2265', '3001', '5997', '3393', 'o', '6551', '7305', '9007', '7931', '8235', 'k', 'l', '1523']

Ex Output:
40552


Ex Input:
3, 16, ['1661', '2609', '7987', '619', '6765', '5249', '1377', '8971', 'J', 'o', '4803', 'O', '699', '4415', 'V', '1813', 'j', 'm', 'L']

Ex Output:
42698


Ex Input:
2, 4, ['F', '9829', 'N', '5885', '7557', 'O', 'E', '8595', 'k', 'C', '965', 'g', '541', '1787']

Ex Output:

15714