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.
9, 21, ['M', 'P', '8637', 'P', '9363', '8453', '497', '6745', 'B', '8889', 'N', '3241', 'p', 'q', 'q', 'b', '8349', 'h', '3425', 'b', '7517', 'D', '6357', 'F', '5387']