Deep in the rook towers of Chessfield, Dorian studies rows of shelves entries. One clean number will settle the guild's oldest argument. 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 <= 11327; 0 <= a[i],x <= 1000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 11327; 0 <= a[i],x <= 1000.
