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: 11, 13, ['L', 'v', 'o', '8089', 'u', '7105', '4451', '9785', 'e', 'p', 'p', '7077', '2815', 'v', 'p', '3593', 't', '6771', 'd', '2651']
Example Output: 9892

Example Input: 3, 15, ['q', '3851', '3631', 'z', '6681', 'Z', '461', 'K', 'P', 'i', '9039', '5929', '1415', 'o', 'O', 'H', '4047', 'B', '7073', '2087', 'I', '6857', '5751', '3633', 'U', '869', 'n', 'h', '7807', '469']
Example Output: 27156

Example Input: 5, 19, ['m', '6399', '5503', 'M', 'z', 'Q', '8585', 'F', 'q', 'd', 'G', '5097', 'R', 'e', 'z', '8157', 'c', 't', '6557', 'f', 'X', '1029', '6649', 'p', '3891', '949', '2311', 'M', 'f']
Example Output:
28396