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: 1, 7, ['v', '8881', '2711', '7569', 'C', '6117', '1569', '1257', 'h', '5407']
Example Output: 26847

Example Input: 2, 5, ['m', 'o', 't', 'c', 'S', 'R', 'I', '4937', '1127', '1611', '285', '3653', '309', 'y', '513', 'i', '8005', 'n', '6915', '8585', 'G', 'A', '1921', 'd']
Example Output: 0

Example Input: 3, 11, ['5433', '5503', '7947', '9049', 's', '6249', 'D', '1391', '1573', 'W', '7239', '1785', 'K', '9869', '3929', '1981', 'j']
Example Output:
33448