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: 5, 21, ['f', 'c', 'y', '1711', '3261', 'I', '3249', 'O', '7875', 'm', '7665', '375', 'V', '4561', 'v', 'J', '2809', '2081', 'i', 'v', 'S', 'f', '8393', 'P', 'r', '4103', 'q', '1141', '9971', '671']
Example Output: 31876

Example Input: 4, 6, ['v', 'f', '5021', 'v', 'M', '6345', '1159', 'C', '8173', '6299', 'r', '8877', 'a', 'm', 'k', '2935']
Example Output: 6345

Example Input: 1, 4, ['1261', 't', 'h', '3615', '7919', 'k']
Example Output:
4876