Problem: Bob got a job as a system administrator in X corporation. His first task was to connect n servers with the help of m two-way direct connection so that it becomes possible to transmit data from one server to any other server via these connections. Each direct connection has to link two different servers, each pair of servers should have at most one direct connection. Y corporation, a business rival of X corporation, made Bob an offer that he couldn't refuse: Bob was asked to connect the servers in such a way, that when server with index v fails, the transmission of data between some other two servers becomes impossible, i.e. the system stops being connected. Help Bob connect the servers.

Input

The first input line contains 3 space-separated integer numbers n, m, v (3 ≤ n ≤ 105, 0 ≤ m ≤ 105, 1 ≤ v ≤ n), n — amount of servers, m — amount of direct connections, v — index of the server that fails and leads to the failure of the whole system.

Output

If it is impossible to connect the servers in the required way, output -1. Otherwise output m lines with 2 numbers each — description of all the direct connections in the system. Each direct connection is described by two numbers — indexes of two servers, linked by this direct connection. The servers are numbered from 1. If the answer is not unique, output any.

Examples

Input

5 6 3


Output

1 2
2 3
3 4
4 5
1 3
3 5


Input

6 100 1


Output

-1

Solution (in JAVA):

Solution:
import java.util.Scanner;

public class C {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();
        int v = sc.nextInt();
        int[][] edges = new int[m][2];
        int idx = 0;
        if (m < n-1) {
            System.out.println(-1);
            return;
        }
        m-=(n-1);
        int prev=(v-1+n)%n;
        if(prev==0) prev=n;
        edges[idx][0]=prev;
        edges[idx++][1]=v;
        int cur=(v+1)%n;
        if(cur==0) cur=n;
        int nxt=(cur+1)%n;
        if(nxt==0) nxt=n;
        while(true){
            if(nxt==prev) break;
            edges[idx][0]=cur;
            edges[idx++][1]=nxt;
            nxt=(nxt+1)%n;
            if(nxt==0) nxt=n;
        }
        edges[idx][0]=v;
        edges[idx++][1]=cur;
        cur=(cur+1)%n;
        if(cur==0) cur=n;
        nxt=(cur+1)%n;
        if(nxt==0) nxt=n;
        while(m>0&&cur!=prev){
            if(nxt==prev){
                cur=(cur+1)%n;
                if(cur==0) cur=n;
                nxt=(cur+1)%n;
                if(nxt==0) nxt=n;
                continue;
            }
            m--;
            edges[idx][0]=cur;
            edges[idx++][1]=nxt;
            nxt=(nxt+1)%n;
            if(nxt==0) nxt=n;
        }
        if(m>0){
            cur=(v+2)%n;
            if(cur==0) cur=n;
            while(m>0&&cur!=prev){
                edges[idx][0]=v;
                edges[idx++][1]=cur;
                cur=(cur+1)%n;
                if(cur==0) cur=n;
                m--;
            }
        }
        if(m>0){
            System.out.println(-1); return;
        }
        for (int i = 0; i < edges.length; i++) {
            System.out.println(edges[i][0] + " " + edges[i][1]);
        }
    }
}