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:
2, 9, ['F', '7137', '6127', 'q', '6637', '1423', 'w', '4175', '8971', '3999', '193']

Ex Output:
34470


Ex Input:
1, 2, ['9769', 'z', '6349', 't', '9391', '7181', '2405', 'j']

Ex Output:
9769


Ex Input:
1, 1, ['2471', '197']

Ex Output:

2471