PROGRAMMING:Find the last integer that meets the condition
This problem requires the preparation of procedures, the input of $$n $$integers into the array $$a $, and then in the array $$a $$to find the given $$x $. If the value of the element in array $$a $$is the same as that of $$x $$, the subscript of the last element satisfying the condition (subscript starts from 0) is output; If not found, output "not found".
###Input format:
Input in line 1, give a positive integer $$n $$($$1 / Le n / Le 100 $$) and an integer $$x $$, and in line 2, enter $$n $$integers separated by spaces. The topic guarantees that the data does not exceed the range of long integers.
###Output format:
If found, output the subscript of the last element with the same value as $$x $$; If not, output "not found" in one line.
###Input sample 1:
```in
5 9
2 9 8 1 9
```
###Output sample 1:
```out
four
```
###Input sample 2:
```in
10 101
2 8 10 1 9 8 -101 0 98762 1
```
###Output sample 2:
```out
Not Found
```
answer：If there is no answer, please comment
###Input format:
Input in line 1, give a positive integer $$n $$($$1 / Le n / Le 100 $$) and an integer $$x $$, and in line 2, enter $$n $$integers separated by spaces. The topic guarantees that the data does not exceed the range of long integers.
###Output format:
If found, output the subscript of the last element with the same value as $$x $$; If not, output "not found" in one line.
###Input sample 1:
```in
5 9
2 9 8 1 9
```
###Output sample 1:
```out
four
```
###Input sample 2:
```in
10 101
2 8 10 1 9 8 -101 0 98762 1
```
###Output sample 2:
```out
Not Found
```
answer：If there is no answer, please comment