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.
14, 22, ['59', '8667', 'l', '6399', 'G', '6733', 'l', '6373', 'D', '6103', '83', 'U', '2663', '1351', '203', '6645', '5137', '4593', 'A', 'A', 'Q', '3893', 'o', '787', '4213', '8413', 'F', '7805', '8847', 'q']