Problem: How many specific orders do you know? Ascending order, descending order, order of ascending length, order of ascending polar angle... Let's have a look at another specific order: d-sorting. This sorting is applied to the strings of length at least d, where d is some positive integer. The characters of the string are sorted in following manner: first come all the 0-th characters of the initial string, then the 1-st ones, then the 2-nd ones and so on, in the end go all the (d - 1)-th characters of the initial string. By the i-th characters we mean all the character whose positions are exactly i modulo d. If two characters stand on the positions with the same remainder of integer division by d, their relative order after the sorting shouldn't be changed. The string is zero-indexed. For example, for string 'qwerty':

Its 1-sorting is the string 'qwerty' (all characters stand on 0 positions),

Its 2-sorting is the string 'qetwry' (characters 'q', 'e' and 't' stand on 0 positions and characters 'w', 'r' and 'y' are on 1 positions),

Its 3-sorting is the string 'qrwtey' (characters 'q' and 'r' stand on 0 positions, characters 'w' and 't' stand on 1 positions and characters 'e' and 'y' stand on 2 positions),

Its 4-sorting is the string 'qtwyer',

Its 5-sorting is the string 'qywert'.

You are given string S of length n and m shuffling operations of this string. Each shuffling operation accepts two integer arguments k and d and transforms string S as follows. For each i from 0 to n - k in the increasing order we apply the operation of d-sorting to the substring S[i..i + k - 1]. Here S[a..b] represents a substring that consists of characters on positions from a to b inclusive.

After each shuffling operation you need to print string S.

Input

The first line of the input contains a non-empty string S of length n, consisting of lowercase and uppercase English letters and digits from 0 to 9. 

The second line of the input contains integer m – the number of shuffling operations (1 ≤ m·n ≤ 106). 

Following m lines contain the descriptions of the operations consisting of two integers k and d (1 ≤ d ≤ k ≤ n). 

Output

After each operation print the current state of string S.

Examples

Input

qwerty
3
4 2
6 3
5 2


Output

qertwy
qtewry
qetyrw

Note

Here is detailed explanation of the sample. The first modification is executed with arguments k = 4, d = 2. That means that you need to apply 2-sorting for each substring of length 4 one by one moving from the left to the right. The string will transform in the following manner:

qwerty →  qewrty →  qerwty →  qertwy

Thus, string S equals 'qertwy' at the end of first query.

The second modification is executed with arguments k = 6, d = 3. As a result of this operation the whole string S is replaced by its 3-sorting: 

qertwy →  qtewry

The third modification is executed with arguments k = 5, d = 2. 

qtewry →  qertwy →  qetyrw

Solution (in JAVA):

Solution:
//package codeforces;

import java.io.BufferedReader;
import java.io.Closeable;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.StringTokenizer;

public class C implements Closeable {
    BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
    PrintWriter writer = new PrintWriter(System.out);
    StringTokenizer stringTokenizer;

    C() throws IOException {
//        reader = new BufferedReader(new FileReader("input.txt"));
//        writer = new PrintWriter(new FileWriter("bridges.out"));
    }

    String next() throws IOException {
        while (stringTokenizer == null || !stringTokenizer.hasMoreTokens()) {
            stringTokenizer = new StringTokenizer(reader.readLine());
        }
        return stringTokenizer.nextToken();
    }

    double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }

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

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

    final int MOD = 1000 * 1000 + 3;

    int sum(int a, int b) {
        a += b;
        return a >= MOD ? a - MOD : a;
    }

    int product(int a, int b) {
        return (int) (1l * a * b % MOD);
    }

    int pow(int x, int k) {
        int result = 1;
        while (k > 0) {
            if (k % 2 == 1) {
                result = product(result, x);
            }
            x = product(x, x);
            k /= 2;
        }
        return result;
    }

    int inv(int x) {
        return pow(x, MOD - 2);
    }

    void solve() throws IOException {
        char[] str = next().toCharArray();
        final int n = str.length;
        int m = nextInt();
        class Util {
            int[] buffer = new int[n];

            int[][] getCycles(int[] r) {
                int k = r.length;
                boolean[] used = new boolean[k];
                List<int[]> cycles = new ArrayList<>(k);
                for(int i = 0; i < k; i++) {
                    if(!used[i]) {
                        int bi = 0;
                        for(int j = i; j != k && !used[j]; j = r[j]) {
                            used[j] = true;
                            buffer[bi++] = j;
                        }
                        cycles.add(Arrays.copyOf(buffer, bi));
                    }
                }
                return cycles.toArray(new int[cycles.size()][]);
            }
        }
        Util util = new Util();
        for(int qq = 0; qq < m; qq++) {
            int k = nextInt();
            int d = nextInt();
            int[] p = new int[k];
            int goesTo = -1;
            for(int i = 0; i < d; i++) {
                for(int j = i; j < k; j += d) {
                    p[j] = goesTo++;
                }
            }
            int[] r = new int[k];
            Arrays.fill(r, k);
            for(int i = 1; i < k; i++) {
                r[p[i]] = i;
            }
            int[][] cycles = util.getCycles(r);
            char[] s = new char[n];
            int[] chain = cycles[0];
            for(int i = 0; i < n - k + 1; i++) {
                s[i] = i < chain.length ? str[chain[i]] : str[k + i - chain.length];
            }
            int offset = n - k;
            int stayInChain = Math.max(0, chain.length - (n - k));
            int addToChain = chain.length - stayInChain;
            for(int i = n - k; i < chain.length; i++) {
                s[offset + chain[i - (n - k)]] = str[chain[i]];
            }
            for(int i = 0; i < addToChain; i++) {
                s[offset + chain[chain.length - 1 - i]] = str[n - 1 - i];
            }
            for(int ci = 1; ci < cycles.length; ci++) {
                int[] cycle = cycles[ci];
                int rotations = (n - k) % cycle.length;
                for(int i = 0; i < cycle.length; i++) {
                    int j = (i - rotations + cycle.length) % cycle.length;
                    s[offset + cycle[j]] = str[cycle[i]];
                }
            }
            goesTo = 0;
            for(int i = 0; i < d; i++) {
                for(int j = i; j < k; j += d) {
                    str[goesTo++] = s[offset + j];
                }
            }
            System.arraycopy(str, 0, s, offset, k);
            writer.println(s);
            str = s;
        }
    }

    public static void main(String[] args) throws IOException {
        try(C c = new C()) {
            c.solve();
        }
    }

    @Override
    public void close() throws IOException {
        reader.close();
        writer.close();
    }
}