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.

Input: Consider Input: 15, 23, ['z', '4587', '8709', '977', 'J', '823', '6437', '3817', 'X', '399', '2265', '3001', '5997', '3393', 'o', '6551', '7305', '9007', '7931', '8235', 'k', 'l', '1523']

Output: 40552


Input: Consider Input: 1, 8, ['O', 's', '3399', '1813', 'T', '4477', '7161', 'z', '1173', 'Y', '6051', '7509', 'i', '9765', '809', '6191', 'f', '1983', 'm', '1043', '8465', '9511', 'i', 'p', '4891', 'K', 'W', 'W', '239']

Output: 16850


Input: Consider Input: 10, 12, ['m', '5639', '4905', '2921', 'W', 'L', 'N', '8969', '2223', '4833', '3855', 'E', 'c', 'O']


Output: 8688