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:
6, 10, ['5601', '3783', '7919', '9195', 'G', 'J', 'L', 'X', 'O', 'F', '2479', 's', 'H', '5353', '7079', '2199', '2937', 'S']

Ex Output:
0


Ex Input:
3, 4, ['9567', '9317', 'l', 'n', 'i', '6993', '2775', '2651', '1311', '2955', '6271', 'b', '7333', 'U', 'd', '6455', 'n', 'o', '1871', 'u']

Ex Output:
0


Ex Input:
15, 18, ['2871', '5107', '8503', 'W', 'A', '7721', '5083', 'r', 'f', '8463', '6863', '6175', 'L', 'M', '9869', '7363', '113', 'u', '6895', 'r', '3833', '3501', '3001', 'U', '5867']

Ex Output:

17345