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.
20, 21, ['F', 'v', '5313', '7339', 'i', '6861', '5163', '6371', '5193', '6379', 'P', 'P', '2383', '9593', '2457', '1969', 'r', '3651', '6961', 'S', 'N', 'E', 's', '7509']