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:
17, 17, ['I', 'd', '1961', '8361', 'B', '2463', '197', 'J', '4231', '543', '3629', 'm', '9433', '4359', '633', 'Y', '1339', 'e', '9633', '4531', 'G', '9021', 'k', 'V']

Ex Output:
1339


Ex Input:
3, 4, ['2425', 'J', 'x', '8829', 't', '7927', 'R', 'J', '1599', '3149']

Ex Output:
8829


Ex Input:
1, 10, ['T', '325', '1635', '7959', 'j', '7853', 'S', '4367', '3837', 'O', '3393']

Ex Output:

25976