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:
12, 23, ['A', 'i', '4191', 'B', '2297', '3959', '1125', 'c', '739', '7887', 'p', '8173', '5301', '1969', '9737', '7011', '9845', 'r', '2977', 'z', 'Q', 'N', '3847', 's', 'D', '3391', 'T']

Ex Output:
48860


Ex Input:
10, 14, ['E', 'P', 'm', 'o', '4203', '657', 'Z', '9975', 'p', '4013', 'M', 'm', '7369', 'x', 'K', 's', '9411', '9787', '4293', '8229']

Ex Output:
11382


Ex Input:
15, 16, ['F', '5415', 'R', 'u', '9899', 'd', '1625', '4655', 'b', 'L', '277', '6545', 'K', 'd', 'K', '8363', '1643', '8989', '4787', 'B', 'L', 'e', 'J', '5063', '8589', '3255', 'I', 'H', 'M']

Ex Output:

8363