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: 2, 7, ['7349', 'P', 'i', 'I', 'e', 'f', '9829']

Output: 9829


Input: Consider Input: 7, 11, ['n', '851', '1155', '5763', 'k', 'f', '3761', '1167', 'E', 'h', '1261']

Output: 6189


Input: Consider Input: 8, 17, ['Y', '573', '1731', 'v', 'U', '561', '4865', '1973', '3765', '6737', 'G', '1433', '9265', '7023', '207', '7507', 'E']


Output: 37910