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.
1, 30, ['8909', '8281', '8815', '4783', 'Q', '2849', 'p', 's', 'v', '7513', 'C', 'i', 'T', 'Y', '1735', '7955', '4243', 'j', 'C', 'y', 'G', 'P', '7393', 'Z', '4187', 'o', '3977', 'Z', 'Y', 'C']