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:
4, 7, ['6307', 'N', '5209', 'M', 'k', 'd', '6933']

Ex Output:
6933


Ex Input:
1, 5, ['5033', '343', 'g', 'q', 'D', '4011', 'Z', '7925', '4297', '1155', '3967', 'e', 'E', 'c', 'I', 'B', '4985', 'B', 'i', '4707', '7205', 'M', 's', 'i', '5121', 'p']

Ex Output:
5376


Ex Input:
12, 18, ['8343', '4419', '1625', 'O', '5835', 'O', 'O', 'k', 'T', 'A', '3427', '2211', 'U', '2727', '3289', 't', '8519', 'N', 'k', 'r', '477', '93', 'J']

Ex Output:

16746