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:
1, 11, ['5355', 'C', 'U', '7363', 'A', 'F', '2893', 'L', 'q', '8973', '8853', '9297', 'v', 'z', 'u', '1227', 'J', '5333', '2515', '6461']

Ex Output:
33437


Ex Input:
3, 17, ['T', 'j', '9425', '2255', '8915', '7957', 'U', '5987', '9461', 'A', 'g', 'n', 'F', '637', '475', 't', 'y']

Ex Output:
45112


Ex Input:
4, 17, ['2051', 'K', 'F', '3419', 'J', '8311', '8829', '3787', 'X', 'G', 'T', 'P', 'e', 'b', '9387', '4679', '303', '9383', '2963']

Ex Output:

38715