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:
7, 9, ['6409', '7805', '2757', 'A', '8949', '449', 'N', 'M', '9511', 'v', '6085', '1101', '4995', 'B', '6039', '295', '5459', '4211', 't', '3415']

Ex Output:
9511


Ex Input:
3, 17, ['T', 'j', '9425', '2255', '8915', '7957', 'U', '5987', '9461', 'A', 'g', 'n', 'F', '637', '475', 't', 'y']

Ex Output:
45112


Ex Input:
4, 13, ['8715', '8715', 'R', 'Z', '353', '7757', '4925', 'z', '2345', 'G', '1339', 'H', 'G', 'v', '3305', '8185', '5737', '2387', 'O', '9625', '3891', '2871', '425', 'J', 'n']

Ex Output:

16719