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.
9, 9, ['D', '3707', '8445', 'E', '5113', 'V', 'p', '8551', '9919', 'Y', 'E', '5055', 'x', '3915', 'K', '9121', '3451', '497', '4873', 'V']