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, 13, ['4971', '1205', '4887', 'j', '1303', 'e', 'K', '6681', 'x', 'g', 'I', '1895', 'q', '9441', 'u', 'J', 'u', 'J', 'V', 'a', '5797', 'h', '2629', 'q', 'm', '3877', 'Y', 'W', '5323']