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.
14, 15, ['j', 'n', '4889', '1895', '2879', 'x', '9321', 'q', '4979', 'j', '8731', '4277', 'Y', 'P', '2025', '9215', '6971', 't', '199', 'l', 'r', '4035', '6915', 'A']