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:
5, 16, ['a', '2439', 'p', '6759', 'z', '2233', 'q', '1447', 'Y', 'k', 'Y', 'Y', '4489', 'N', '5251', '5367']

Ex Output:
18787


Ex Input:
1, 5, ['5057', 'Z', 'a', '4561', '225', '6921', 'T', '4033', '1259', '9805', 'l', '5641']

Ex Output:
9843


Ex Input:
6, 18, ['6143', '8035', '9895', 'T', '9101', '2991', '9715', '4367', 'b', '1555', 'P', 'C', 'e', 'C', 'B', '559', '6477', 'Z', '4419', '8313', '3051', '8991', 'Z', '7551']

Ex Output:

25664