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: 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: 1, 7, ['173', '5875', 'C', '7417', '3565', '1949', '537', '7707', 'o', 'y']

Output: 19516


Input: Consider Input: 4, 11, ['5261', '8705', '1407', 'o', 'V', 'c', 'i', 'R', '7719', 'm', '7459']


Output: 15178