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.

3, 16, ['1165', 't', '4833', 'b', '6361', '1175', '3943', 'd', 'l', '7519', 'j', 'X', 'E', 'A', 'm', '6469', '9429', '2415', '5187', 'k', 'd', '9607', '1375', '8913', 'c', 'A', '9229']
30300

3, 14, ['D', 'Q', 'W', '3925', '7569', '2455', '9499', 'A', '3205', '9459', 't', '9053', 'q', 'T']
45165

7, 16, ['7453', '2741', 'g', 'i', 'c', 'R', 's', 'Y', '1991', 'B', 'P', '7955', '3777', 's', '9433', 'Q', 'U', 'W', 'r', '8735', '8917', '6547', 'N', 'w', 'T', '8427', 'l', 'w', '6837', 'i']

23156

