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:
3, 4, ['I', '8765', 'a', '719', '2555', 'w', '3437', '6159', 'e', '5239']

Ex Output:
719


Ex Input:
14, 15, ['N', 'u', '4633', '5481', '2469', 'y', '2253', '4629', '8399', 'q', 'H', '8507', '1789', 'A', '5085', 'G', '9679', 'G', 'u', '9381']

Ex Output:
5085


Ex Input:
13, 15, ['9425', '4725', 'o', 'E', '5195', 'I', '5731', 'S', '1119', 'w', '5687', 'z', 'l', '9555', '8963', 'v', '2639', 'P', 'C', 'g', '4865', 'q', '9835', 'h', 'W', 'B']

Ex Output:

18518