Cora runs the ropewalk at the mulberry rows of Silkmead. Today the books show a list of crates, and the numbers must be worked out before sundown. Task: The array is sorted non-decreasing. Print the 1-based position where x would be inserted to keep the order (before equal values). Input format: First line: n and x. Second line: n sorted integers. Output format: Print the insertion position (1..n+1). Constraints: 1 <= n <= 6877; -1000000 <= a[i],x <= 1000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 6877; -1000000 <= a[i],x <= 1000.
