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.
11, 20, ['3273', 'Y', '1689', '5837', '7505', 'n', 'R', 'R', '7277', '1477', 'C', 'O', 'u', '1445', '5077', '8335', 'V', '4923', 'e', '8411', 'F', 'P', '6935', 'x', '6645', 'o', 'c', 'R', 'S']