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.

1, 3, ['m', '6287', '41', 'W', '9113', 'P', 'w', 'H', '1651', '8837', '1907', 'e', 'N', 'q', 'j', 'd', 'c', '2459', '6635']
6328

3, 6, ['7233', '7997', 'a', '727', '8387', 'Q', '1313', 'E']
9114

5, 10, ['8467', '7353', '4695', 'k', 'V', '3215', '149', 'h', 'n', 'L', '4091', '4565', '1057']

3364