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, 2, ['E', 'z']

Ex Output:
0


Ex Input:
2, 20, ['7991', '1029', 'L', '3307', 'A', '6641', '8833', 'J', '2751', '7457', 'f', '943', 'D', '5609', '5123', '5561', 'N', '1755', '1117', 'C', 'k', '6657', '2569']

Ex Output:
50126


Ex Input:
5, 11, ['8429', 'z', 'S', '8443', '2229', 'K', 'o', '4521', '1287', '2815', 'V', '4525', 'O', '4961', 'd', '8701', 'P', 'L', 'f', 'e', 'E', '1345', 'w', '8101', '837', 'x', '6479', '4307']

Ex Output:

10852