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.
12, 22, ['d', 'V', 'E', 'v', 'v', '97', '3857', 'w', 'M', '3589', 'a', '7053', '9887', 'L', 'b', 'n', '2579', '5151', '1559', '715', '9853', 'S', '3161', 'x', 'u']