import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.StringTokenizer;
import java.util.*;
import static java.lang.System.*;
/*
    Shortcut-->
    Arrays.stream(n).parallel().sum();
    string builder fast_output -->

 */
public class cf_hai1 {

    static class FastScanner {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer("");

        String next() {
            while (!st.hasMoreTokens())
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        int[] readArray(int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++) a[i] = nextInt();
            return a;
        }

        long nextLong() {
            return Long.parseLong(next());
        }
    }


    public static void main(String[] args) throws IOException {
        cf_hai1.FastScanner sc = new cf_hai1.FastScanner();
       // int test_case = sc.nextInt();
         int test_case=1;
        for (int z = 0; z < test_case; z++) {
            int n=sc.nextInt();
            int x=sc.nextInt();
            int y=sc.nextInt();
            int arr[] =sc.readArray(n);
            solve(arr);
        }
    }

    private static void solve(int[] a) {
        int n= a.length;
        int left = 0, right = n - 1; // search in interval [0, n]
        while (left < right) {
            int mid = left + (right - left) / 2;
            if (a[mid]<a[mid+1]) {
                right = mid;
            }
            else {
                left = mid + 1;
            }
        }
        out.println((left+1));
    }


}


