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: 2, 6, ['j', 'j', 'W', '1351', 'B', 'e', '2585', '8831', '7465']
Example Output: 1351

Example Input: 7, 12, ['273', 'h', '2433', '7155', '731', '5459', 'q', 'G', 'i', 'l', '3981', 'W', 'V', '4999', '8191', 'K', '8393', '9255']
Example Output: 3981

Example Input: 7, 15, ['V', 'N', 'a', 'T', 'E', 'B', '4465', 'a', '8407', 'g', '4171', 'W', '7323', 'v', 'e', 'h', 'h', 'u', '1751', '8349', 'i', 'b', 'c', '2837']
Example Output:
24366