#include<iostream>

 #include<algorithm>

 #include<cstdio>

 #include<cstdlib>

 #include<cstring>

 #include<cmath>

 #include<list>

 #define rep(i,a,b) for(int i=a;i<b;i++)

 #define NULLKEY -1

 #define DELKEY -2

 using namespace std;

 typedef int KeyType;

 typedef struct{

     KeyType key;

     int count;

 }HashTable;

 void InsertHT(HashTable ha[],int &n,int m,int p,KeyType k)

 {

     int i,adr;

     adr=k%p;

     if(ha[adr].key==NULLKEY||ha[adr].key==DELKEY)

     {

         ha[adr].key=k;

         ha[adr].count=;

     }

     else

     {

         i=;

         do{

             adr=(adr+)%m;

             i++;

         }while(ha[adr].key!=NULLKEY&&ha[adr].key!=DELKEY);

         ha[adr].key=k;

         ha[adr].count=i;

     }

     n++;

 }

 void creatHT(HashTable ha[],int &n,int m,int p,KeyType keys[],int nl)

 {

     rep(i,,m)

     {

         ha[i].key=NULLKEY;

         ha[i].count=;

     }

     n=;

     rep(i,,nl)

     InsertHT(ha,n,m,p,keys[i]);

 }

 bool DeleteHT(HashTable ha[],int &n,int m,int p,KeyType k)

 {

     int adr;

     adr=k%p;

     while(ha[adr].key!=NULLKEY&&ha[adr].key!=k)

         adr=(adr+)%m;

     if(ha[adr].key==k)

     {

         ha[adr].key=DELKEY;

         return true;

     }

     else

         return false;

 }

 void serchHT(HashTable ha[],int m,int p,KeyType k)

 {

     int i=,adr;

     adr=k%p;

     while(ha[adr].key!=NULLKEY&&ha[adr].key!=k)

     {

         i++;

         adr=(adr+)%m;

     }

     if(ha[adr].key==k)

         cout<<k%p<<","<<i;

     else

         cout<<"-1";

 }

 int main()

 {

     int m,n,k,x;

     KeyType keys[];

     HashTable ha[];

     cin>>m>>n;

     rep(i,,n)

         cin>>keys[i];

     cin>>k;

     creatHT(ha,x,m,m,keys,n);

     serchHT(ha,m,m,k);

     rep(i,,n)

         DeleteHT(ha,x,m,m,keys[i]);

     return ;

 }