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, 25, ['H', '501', 'F', '4923', 'C', 'T', 'R', 'b', 'Z', 'e', 'i', 'H', '755', '6503', '2825', 'H', '1995', '7283', '2735', '4433', 's', 'P', '795', 'Z', 'Z']

Ex Output:
32247


Ex Input:
11, 13, ['O', '4429', 'F', '2013', 'v', 'p', 'y', '507', 'g', '935', '1827', 'Q', '4267', 'A', 'm', 'g', 'k', 'S', 'a', 'C', 'q', 'W', 'M']

Ex Output:
6094


Ex Input:
3, 21, ['927', '3395', '1165', 't', 'a', 'L', '9661', '9779', '775', 'v', 'O', 'Q', '7237', 'z', 't', 'l', '1065', '9695', '8901', '9197', 'W', '2177', 'K', 'M', 'g', '4917', '177', 'n', '4241']

Ex Output:

57475