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.
10, 26, ['N', 'x', 'Y', 'L', '321', '9779', '4903', '8497', '9889', '723', 'e', '7299', 'P', 'x', 'u', '7481', '9691', '615', 'h', 'R', 'F', '8003', 'r', 'N', '3447', '587', 'n', '4641', 'm']