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, ['u', 'Z', 'j', 'A', 'N', 's', 'h', '7331', '8259']
Example Output: 0

Example Input: 2, 15, ['l', '5597', 'M', 'l', '6065', '7949', 'e', '433', '8159', 'N', 'Z', '5597', 's', 'k', '6973', '8387', 'n', 'W', '9895']
Example Output: 40773

Example Input: 8, 12, ['7857', '6119', 'S', 'E', '4589', 's', '921', 'M', '1045', 'b', '2069', '9567']
Example Output:
12681