#include <iostream>

 #include <cmath>

 #include <cstdio>

 #define ll long long

 using namespace std;

 const int N = 5e5+;

 struct Info{

     char name[];

     int turn;

 }p[N];

 struct node{

     int l,r,value;

     int mid(){ return (l+r) >> ; }

 }tree[N << ];

 int c[N];

 int n, s, ss, inx;

 int pr[] = {,,,,,,,,,};

 int Max,num;

 void dfs(int inx, int v, int cnt, int pw){

     for(int i = ; i <= pw; ++i){

         if((ll)v * pr[inx] > (ll)n){

             if(Max < cnt * i){

                 Max = cnt * i;

                 num = v;

             }else if(cnt * i == Max) num = min(num, v);

             break;

         }

         else dfs(inx + , v *= pr[inx], cnt * (i + ), i);

     }

 }

 //反素数模板

 void AntPrime(){

     Max = ;

     dfs(, , , );

 }

 void build_tree(int rt, int L, int R){

     tree[rt].l = L; tree[rt].r = R;

     if(L == R){

         if(L == s) inx = rt;

         tree[rt].value = ;

         return;

     }

     int mid = tree[rt].mid();

     int lson = rt << ;

     int rson = rt <<  | ;

     build_tree(lson, L, mid);

     build_tree(rson,mid + , R);

     tree[rt].value = tree[lson].value + tree[rson].value;

 }

 void update(int x){

     while(x != ){

         --tree[x].value;

         x >>= ;

     }

 }

 void search(int tot,int rt){

     //找到位置

     if(tree[rt].l == tree[rt].r){

         ss = tree[rt].l; //原始队列的位置

         inx = rt; //线段树的位置，方便更新

         return;

     }

     int lson = rt << ;

     int rson = rt <<  | ;

     if(tree[lson].value >= tot) search(tot, lson);

     else search(tot - tree[lson].value, rson);

 }

 void solve(){

     while(~scanf("%d%d", &n, &s)){

         build_tree(,,n);

         AntPrime();//得到反素数和它的约数个数

         for(int i = ; i <= n; ++i){

             scanf("%s%d", p[i].name, &p[i].turn);

         }

         int cnt = ;

         int remain = n;

         //s  淘汰队列人的位置

         //ss 原始队列人的位置

         ss = s;

         while(++cnt != num){

             update(inx);//更新线段树

             int turn = abs((double)p[ss].turn);

             turn %= (remain - );

             if(!turn) turn = remain - ;

             if(p[ss].turn > ){

                 int r = remain - s;

                 if(r >= turn) s = s + turn - ;

                 else s = turn - r;

             }else{

                 int l = s - ;

                 if(l >= turn) s = l - turn + ;

                 else s = (remain - ) - (turn - l) + ;

             }

             // cout << "position is " << ss << endl;

             // cout << "jumped out people  " << p[ss].name << endl;

             search(s, );

             --remain;

         }

         printf("%s %d\n", p[ss].name, Max);

     }

 }

 int main(){

     solve();

     return ;

 }