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, 3, ['E', '6187', '5861', '3697', '2749', '1171', '6085', 'c', '2291', '2385', '7335', 'B']
Example Output: 12048

Example Input: 8, 9, ['1329', '3107', 's', 'z', '2013', '1633', 'i', '1229', '4201', 'M', '3127']
Example Output: 5430

Example Input: 3, 18, ['121', 'U', 'E', '7289', '6433', '9685', '5417', '3809', '6521', '4693', 't', 'h', 'l', '5089', 'F', '9127', 'G', '3647', 'o', '8773', 'g']
Example Output:
61710