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: 10, 11, ['A', 'H', 's', '8033', 'M', '7393', '1231', 'T', '5025', '1739', 'q', '4233']
Example Output: 1739

Example Input: 3, 4, ['u', '5041', 'E', 'U', 'a', 'd']
Example Output: 0

Example Input: 8, 19, ['V', 'V', 'G', '8353', 'x', 'L', 'j', 'C', '2415', 'f', '2131', 'h', '6069', '3779', 'p', 'w', '4535', 'l', 'J', '5311', '4501', '2663', 'K']
Example Output:
18929