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:
5, 14, ['r', '5851', '5957', '1951', '9761', '6805', '2323', 'J', '703', '9479', '6653', 'L', '513', 'A', 'v', '4273', '391', 'b']

Ex Output:
36237


Ex Input:
2, 5, ['r', 'Y', '3769', 'k', '6407', 'G', 'M']

Ex Output:
10176


Ex Input:
15, 16, ['9011', 's', '8515', '3709', '9533', '6587', '4739', '7269', '9419', 'u', 'O', 'W', 'b', '8475', '4173', '1259', 'W', 'Y', 'J', '3145', '497', '8921', 'o', 'w', '3313', 'b', '2343', '6169']

Ex Output:

5432