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:
8, 22, ['h', '2971', 'l', 'F', 'e', 'f', 'b', 'I', 'b', '4759', 'm', 'w', '6179', 'R', '2875', '3469', '3801', 'm', '6987', 'A', 'c', '6303', '8135', 'c']

Ex Output:
34373


Ex Input:
1, 4, ['H', 'V', 'w', '4621', 'C', '3763', '1271', '967']

Ex Output:
4621


Ex Input:
5, 8, ['s', 'Q', 'c', '9159', '6031', '6267', '5619', '4701', '7327', '6691', '3769']

Ex Output:

22618