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, 13, ['5163', 'v', 'm', '7873', '6075', '1515', '5489', 'N', 'k', '7281', '7313', '1017', 'F', 'k', '5869', '4305', 'P', '3201', '3571', '369', '4831', 'z', 'R']