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.

Example Input: 2, 2, ['M', 'I', 'G', '3747']
Example Output: 0

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

Example Input: 5, 16, ['L', '4633', 'Z', '725', '7759', 'y', '2993', 'u', 'j', '8803', '1241', '4629', 'U', '7109', '7141', '2595', 'y', 'u', '5183']
Example Output:
42270