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.
3, 21, ['6573', 'o', '3085', '9825', '3173', 'd', '4193', 'x', 'r', '7099', 'M', '4779', '4975', 'P', '1163', 'a', 'd', 'r', '7679', 'v', '2075', 'j']