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:
1, 2, ['t', '9343', 'g']

Ex Output:
9343


Ex Input:
4, 12, ['f', '3507', 'T', 's', '9209', 'T', 'o', '769', 'U', 'i', 'V', '5723', '2151', 't', 'Z', '5857', '951', '3261', 'd', '407', 'X', '1869', '1483', '3631', '2949']

Ex Output:
15701


Ex Input:
5, 8, ['1047', 'D', '2237', '1473', 'P', 'X', 'S', 'q', '3301', '9937', '2093']

Ex Output:

0