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, 4, ['L', '8053', '8121', 'J', 'H', '7591', 'U', 'm']
Example Output: 16174

Example Input: 7, 12, ['K', '5995', '5183', '67', '563', '9143', 'M', 'H', '2923', '1825', 'y', '373', 'm', 'w', 'x']
Example Output: 5121

Example Input: 1, 4, ['S', 'p', 'R', 'L', 'e', '7867', '8591', '2469', '4755', '8027']
Example Output:
0