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.
11, 20, ['q', '3555', '4133', 'Z', '3423', '7993', 'R', 'w', 'B', '2681', '4353', '1247', '101', '9365', 'R', '5417', '405', 'E', 'G', '385', '8233', '2929', '6485', 'E', 'A']