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:
2, 2, ['5189', 'J']

Ex Output:
0


Ex Input:
4, 10, ['C', '6511', 'S', '5389', '5679', 'O', 'Z', 'm', 'p', '1135', '7887', '6407', '6561']

Ex Output:
12203


Ex Input:
11, 26, ['3119', 'w', '4639', '5549', '2677', '641', '7129', '3455', 'D', '6169', 'E', '6313', 'A', '1113', 'A', 't', '107', 's', 'd', 'E', 'm', 'b', 'X', '6753', '3647', 'z', '7147', '8495', '6351', '6875']

Ex Output:

17933