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:
11, 16, ['3847', '4705', '7023', '7353', '9569', '7437', 'G', '7437', 'O', '8789', 'k', 'r', '8083', '7213', '4027', '595', 'P', 'n', '1377', '3271', '6443', '3251', 'K', 'K']

Ex Output:
19918


Ex Input:
7, 8, ['R', 'r', '6533', '3469', '3973', '1915', 'p', 't', 'a']

Ex Output:
0


Ex Input:
1, 15, ['h', 'X', '6757', 'X', 'K', '1891', 'C', '3983', 'q', '8295', 'P', 'K', '27', '457', '9513', 'l', '8681', 'b']

Ex Output:

30923