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, 22, ['u', 'A', '3137', '3621', '9823', '2977', '6691', '4849', 'm', 'g', '7911', 'h', '3179', 'r', '6579', 'v', 'F', 'e', 'X', '393', 'M', '5339', '489', '405', 'A']