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, 9, ['9825', '3055', '9869', 'B', 'a', 'W', 'Q', 'k', '4383', 'Q', '8523', 's', 'R', '1481', '5887', '239', 'M', '7121', '6311']

Ex Output:
4383


Ex Input:
25, 27, ['6411', '2467', 'y', '4973', 'C', '8853', 'H', 'G', 'a', 'N', '3759', '7803', '5403', 'Z', '4047', '6283', 'v', '5437', 'p', 't', 'S', '7605', 's', 'Z', '7537', 'Y', 'U', 'W', '2147', 'K']

Ex Output:
7537


Ex Input:
13, 19, ['r', 'x', '8153', 'o', 'u', '2245', 'h', '9405', '959', 'x', '6243', 'e', 'u', 'X', '375', 'E', '1155', '1107', '1861', '9761']

Ex Output:

4498