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:
4, 12, ['k', '7775', '1099', '1507', '7609', 'X', 'O', '521', 'u', 'V', 't', '1935', '8171', '2063', 'h', '2961', 'z', '4955', '1359', 'm', '2137']

Ex Output:
11572


Ex Input:
6, 18, ['6619', 'W', '8541', '1049', '3973', '6575', 'C', '4961', '2469', '3553', '6905', 'p', 'c', 'K', '2663', 'm', 'B', '4379', 'D', '6557', 'r', 'N', '4875', 'u', 'X', '3133', '6353', '1635']

Ex Output:
31505


Ex Input:
10, 13, ['2489', 'd', 'B', '5839', '3003', 'N', 'u', '1493', '9667', 'm', '1409', 'I', '3467', '5879', 'v', '259', '4057', '6043', 'R']

Ex Output:

4876