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: 23, 25, ['v', 'J', 'B', 'y', 'G', 'z', 'f', '1651', 'T', 'X', '8701', '701', 'T', 'V', '1037', '4095', '8297', '2733', 'P', 'J', '7759', 'Z', '8153', 'q', '7619']
Example Output: 15772

Example Input: 1, 7, ['u', 'Z', 'j', 'A', 'N', 's', 'h', '7331', '8259']
Example Output: 0

Example Input: 18, 26, ['C', '4769', 'Q', 'b', 'W', '1843', '6497', '467', '9581', 'K', 'T', 'p', 'I', '4503', 'v', 'L', 'u', '8695', 'V', 'T', '5201', '9855', '2567', '3477', 'u', 'n', '4853', 'Q', 'c']
Example Output:
29795