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, 15, ['9021', '2343', '1041', '131', '9027', 'Q', 'v', 'j', '9391', '653', 'p', 'L', '4653', '6163', 'H', 'x', 'N', 'u', 'f', 'L', '6035', 'C', '5355', 'e']

Ex Output:
30018


Ex Input:
9, 21, ['h', 'C', '8411', 'j', '5693', 'L', 'D', 'V', 't', 't', 'E', '3101', '5045', '9945', 'P', 'q', 'e', 'k', 'T', 'b', 'A', '7015', '6635', '3769', 'j', 'X', '6469']

Ex Output:
18091


Ex Input:
5, 9, ['1523', 'C', 'd', 'I', '6913', '5553', '2769', '767', 'v', '231', 'I', 'p', '9033', 'H', '2007', 'g', '5837', 'Z']

Ex Output:

16002