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, ['3291', 'e', 'm', 'E', 'e', '3201', 'E', 'c', '2355', '6491']

Ex Output:
3201


Ex Input:
5, 9, ['125', 'A', 'E', 'X', 'j', '319', 'm', '7037', 'g', 'D', 'g', '6737', 'z', '5249']

Ex Output:
7356


Ex Input:
7, 29, ['2837', '1117', '1279', 'C', 'X', '953', 'T', '7699', 'l', '3133', 'N', '5155', '3977', '7959', 'm', '695', '217', '4891', 'T', 'J', '5941', 'Q', 'L', 'O', '7263', '4629', '2007', 'h', '6749']

Ex Output:

60315