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, 6, ['a', '9091', 'I', '4849', 'O', '2435', 'v']

Ex Output:
16375


Ex Input:
2, 2, ['8149', '7123', 'c', 'X', '1659']

Ex Output:
7123


Ex Input:
6, 10, ['g', 'T', 'c', 'z', '7159', 'X', 'S', 'n', '7925', 'a', 'K', 'w', 'O', 'u', '2189', '9895', '1681', '5359', 'M']

Ex Output:

7925