N children are sitting in a circle to play a game.

The children are numbered from 1 to N in clockwise order. Each of them has a card with a non-zero integer on it in his/her hand. The game starts from the K-th child, who tells all the others the integer on his card and jumps out of the circle. The integer on his card tells the next child to jump out. Let A denote the integer. If A is positive, the next child will be the A-th child to the left. If A is negative, the next child will be the (?A)-th child to the right.

The game lasts until all children have jumped out of the circle. During the game, the p-th child jumping out will get F(p) candies where F(p) is the number of positive integers that perfectly divide p. Who gets the most candies?

Output one line for each test case containing the name of the luckiest child and the number of candies he/she gets. If ties occur, always choose the child who jumps out of the circle first.

#include <iostream>
#include <stdio.h>
#include <cstring>
#include <algorithm>
using namespace std;
#define lson l, m, rt<<1
#define rson m+1, r, rt<<1|1
#define ls rt<<1
#define rs rt<<1|1
#define root 1, N, 1
#define maxn 500010
int N, K;
int maxnum, maxid;
int divd[maxn];
int card[maxn];
char name[maxn][20];

struct line
{
    int l, r, len;
}tree[maxn<<2];

void findMaxFac()
{
    memset(divd, 0, sizeof(divd));
    for (int i = 1; i <= N; i++) {
        divd[i]++;
        for (int j = i*2; j <= N; j+=i) {
            divd[j]++;
        }
    }
    maxnum = divd[1];
    maxid = 1;
    for (int i = 2; i <= N; i++) {
        if (divd[i] > maxnum) {
            maxnum = divd[i];
            maxid = i;
        }
    }
}

void build(int l, int r, int rt)
{
    tree[rt].l = l;
    tree[rt].r = r;
    tree[rt].len = r-l+1;
    if (l == r) return;
    int m = (l + r)>>1;
    build(lson);
    build(rson);
}

int query(int rt, int p)
{
    tree[rt].len--;
    if (tree[rt].l == tree[rt].r)
        return tree[rt].l;
    if (p <= tree[ls].len)
        return query(ls, p);
    else return query(rs, p-tree[ls].len);
}

int main()
{
    //freopen("1.txt", "r", stdin);
    while (~scanf("%d%d", &N, &K)) {
        findMaxFac();
        for (int i = 1; i <= N; i++)
            scanf("%s%d", name[i], &card[i]);
        build(root);
        int pos;
        for (int i = 0; i < maxid; i++) {
            pos = query(1, K);
            N--;
            if (N == 0) break;
            if (card[pos] > 0)
                K = (K-1+card[pos])%N;
            else
                K = ((K+card[pos])%N + N)%N;
            if (K == 0) K = N;
        }
        printf("%s %d\n", name[pos], maxnum);
    }


    return 0;
}