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.
6, 21, ['3685', '4765', '8263', 'e', 'Z', '161', '5043', '2937', '3691', 'R', '8397', 'B', '3935', 'E', '4301', 'l', '5521', 't', '8925', '5827', 'L', 'T']