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:
14, 29, ['1447', 'P', 'X', '5411', '4235', 'K', '6749', '171', '9349', 'K', 'n', '3477', '1183', '9933', '6259', '5793', '1719', 'V', 'C', '1983', '9947', 'I', 'c', '4425', 'Q', 'v', 'a', '3783', '9665', 'z']

Ex Output:
53507


Ex Input:
3, 8, ['3071', 'N', '2157', 'g', 'l', '9317', '8639', '2519', '6257']

Ex Output:
22632


Ex Input:
11, 26, ['Y', '8875', 'z', '2597', 'T', 'A', '4725', 'D', 'j', '2879', 'q', 'V', '5171', '1017', '9103', 'k', '5181', 'm', '6395', '4353', '6445', '7537', '9535', 'Y', 'd', 'n', '2475', '5063', '5499', 'O']

Ex Output:

54737