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.
7, 9, ['u', '5865', 'e', '2547', '6529', 'V', '6365', '8401', 'm', 'w', 'P', '5095', 'u', '6653', '6419', 'V', 't', '8265', '4889', '4925', 'R', 'P']