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.
2, 15, ['5943', '31', 'W', '5109', '1875', 'S', '9533', '5651', '4141', '903', '3449', '1615', '5261', 'x', 'L', 'k', '3015', '221', 'A', '4905', 'x', '6621', '2765', '9273', '3303', '2051']