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, 14, ['J', '4147', 'z', 'M', 'Z', 'd', 'f', 's', '5083', 'L', '7107', 'g', '7047', 'E', '5931', '141', '6889']
Example Output: 23384

Example Input: 7, 19, ['8309', 'O', '1491', 'k', '2521', '1161', 'y', '3215', '8345', '1949', '9883', 'g', 'z', 'B', 'S', 'j', 't', '2841', 'j', '3333', 'S', 'w', '2283', '793', 'w', 'q', 'p', 'J', '7979']
Example Output: 26233

Example Input: 2, 8, ['b', '4981', '1695', '5101', '2651', 'u', 'K', 'C', 'R', '6957', 'G', '915', 'J', 'A', 'A', '4673']
Example Output:
14428