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.
4, 28, ['4857', '1273', 'C', '687', 'p', '9315', '1813', 'f', '9233', '6239', '4855', '2569', 'G', '2329', 'V', '5559', '9067', 'g', '567', 'm', 'Q', '3405', '9909', '2847', 'n', 'z', '1133', 'A', '7641', '3513']