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, ['3309', 'w', '1143', 'D', 'Z', 'd']

Ex Output:
4452


Ex Input:
2, 4, ['3155', '581', 'N', '153', 't', '7941', '6065']

Ex Output:
734


Ex Input:
1, 1, ['2735', '2141', 'x', 'd', 'i', '4229', '7465', '1653', '2973']

Ex Output:

2735