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.
7, 8, ['E', '911', 'X', 'p', 'i', '2431', 't', 'e', '1595', 'i', '5251', 'J', 'B', '3063', 'f', 'K', '1847', 'O', '8073', 'V', '3865', '6423', 'g']