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.
13, 24, ['4005', '6275', '6981', 'E', 'g', '9859', '2787', 'b', '1851', '8325', 's', '983', 'c', 't', 'P', '9835', '9693', '6991', 'R', 'b', '2455', '3443', 'i', '2125', 'G', '1667', '983', 'K', '9395', 'w']