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:
20, 21, ['3975', '2459', 'X', '337', 'X', '5453', '9019', 'O', '4911', '1019', 'y', 'D', 'K', 'W', 'v', '2479', 'a', 'o', '4867', '9195', '3269']

Ex Output:
12464


Ex Input:
1, 7, ['u', 'Z', 'j', 'A', 'N', 's', 'h', '7331', '8259']

Ex Output:
0


Ex Input:
13, 21, ['6913', 'Z', 'd', 'i', '7759', 'M', '2679', 'u', '2355', '5057', '2257', 'm', 'd', 'i', 'Q', 'u', '2841', 'O', '1231', '1577', 'T', '9617', 'N', 'G', 'S', 'C', '781']

Ex Output:

5649