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.
21, 22, ['8341', '3235', 'q', 'l', 't', '3937', 'Y', 'K', 'e', 'g', '729', 'N', '2701', '3887', '6749', 't', '6613', '7451', 'x', '3717', '6461', '8599', '2227', '9275', 'x', '8631', '2631']