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: 6, 14, ['707', 'L', '8503', 'x', 'Y', '921', '8415', '6449', '5711', 'd', '591', 'd', '3827', '5569', 'g', 'U', 'v', '7781', 'E', 'z', '4751', '8541', 'c', 'P', '8037', 'X']
Example Output: 31483

Example Input: 1, 2, ['j', '3613']
Example Output: 3613

Example Input: 2, 5, ['g', 'f', 'Z', '6379', 'f', 'B', 'G', '4047', '6667', '3593', '8379', 'Z', 'z', '5355', '177', 's', '4357', '7781', '8809', '9171', '3517', 'Q']
Example Output:
6379