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:
3, 6, ['r', '8615', '4477', 'k', 'Z', 'B']

Ex Output:
4477


Ex Input:
2, 15, ['4175', '6415', 'U', '8883', 'J', '5843', '3923', '8991', 'P', 'm', 'S', 'T', '5819', 'q', '7405']

Ex Output:
47279


Ex Input:
2, 2, ['5183', '7691', '9303', 'B', 'U', 'V', 'R', '2669', '1939', '6809', '657', '6901', '6581', 'D', '4293', 'w', '5951']

Ex Output:

7691