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: 3, 22, ['k', '427', 'x', '9695', 'a', '2243', '329', 'F', 'n', '6253', '4873', 'f', 'z', 'R', 'b', '4351', 'b', 'i', 'g', '6937', 'I', 'k', 'f']
Example Output: 34681

Example Input: 2, 3, ['E', '7611', '2621', '3237']
Example Output: 10232

Example Input: 7, 20, ['h', '9991', '8887', '9217', 'I', '7165', 'E', 'B', 't', '4939', '4511', '4797', '4339', '3355', '397', 'w', 'c', 'n', '2489', 'k', 'o', 'B', '2651', '8525', 'N', 's', '2921', 'b', 'D']
Example Output:
24827