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.
2, 20, ['8981', 'M', '1223', '241', 'C', '6991', '9679', '8103', '5113', '4263', '6573', '7845', 'Q', '4857', 'r', 's', 'e', '3669', '2579', 'F', '4097', '6885', '9057', '5891', 'g', 'T', '1135']