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: 5, 10, ['3907', '1629', 'v', '6711', '8347', 'E', '4067', 'T', '1665', '5735', '4879']

Output: 19814


Input: Consider Input: 3, 5, ['c', '9619', 'e', 'A', '5045', '2453', 'L', '553', '5493', '5657']

Output: 5045


Input: Consider Input: 10, 16, ['P', 'j', 'P', '465', 's', 'e', 'q', '6637', '701', '6303', '2813', 'k', 'G', '1107', 'y', '4317', 'T', 'E', 'h', '55', 'q']


Output: 14540