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, 27, ['4209', '3099', 'v', '7329', 'Q', 'G', '7923', '7405', '3895', '6129', '693', 'l', '2751', 'p', 'i', '4779', '3127', 'D', '1539', '8539', '8563', '9177', '1877', '8569', 'G', '9451', 'N', '791']