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: 3, 5, ['c', '9619', 'e', 'A', '5045', '2453', 'L', '553', '5493', '5657']

Output: 5045


Input: Consider Input: 2, 4, ['8181', '9349', '2531', 'S', '5333', '3721', '9641']

Output: 11880


Input: Consider Input: 5, 18, ['z', 'z', 'h', '1159', '1475', 'g', 'T', '931', '3841', '5761', '5553', 'I', 'E', '5143', 'A', 'J', '1945', '8347', 'g', '9089', '1277']


Output: 32996