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.
11, 20, ['5101', '2897', 'u', 'g', 'E', '5991', 'G', 'R', '783', '2171', 'D', '549', 'C', 'E', '1039', '2673', '3257', 'o', '4249', '231', '7575', '563', '6247', 'V', 'd', 'W', '6567']