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.

4, 13, ['d', 'v', 'K', '2011', '7323', '5735', 'u', '4227', 's', 'n', '1161', 'm', '5463', 'I', '2813']
25920

5, 6, ['M', '4965', '7693', 'g', 'G', '695', '2401', '5715', 'P', '8197']
695

10, 15, ['8455', '7963', 'r', 'P', '5601', '8203', 'B', 'U', '959', 'D', 'f', '2985', 'J', 'q', '495', '8693']

3480