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, 3, ['c', '2957', 'u', '2321', 'q', 'P', '2347', 'O', 'P', '4463', 'u']

Output: 2957


Input: Consider Input: 4, 5, ['3365', 'x', '3373', '8905', '1527', '9433', '2907', 'j', 'x', '7201', '307', '4507', '785', '6749', '4419', '2743']

Output: 10432


Input: Consider Input: 4, 8, ['J', 'A', 'u', '6607', '8633', '1193', 'G', 'q', 'A', 'n', '1299', '8567', 'K', 'P', '4817', 'J', 't', 'D', 'i', '5477']


Output: 16433