#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <class T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <class T>
inline void printsp(T first) {
  print(first);
  putchar(' ');
}
template <class T>
inline void println(T first) {
  print(first);
  putchar('\n');
}
template <class T, class U>
inline void print(T first, U second) {
  printsp(first);
  println(second);
}
template <class T, class U, class V>
inline void print(T first, U second, V z) {
  printsp(first);
  printsp(second);
  println(z);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
char s[1000111], t[1000111];
int n;
struct permutation {
  int *p;
  permutation() {
    p = new int[n];
    for (int i = 0; i < n; i++) p[i] = i;
  }
  permutation operator*(permutation &u) {
    permutation ans;
    for (int i = 0; i < n; i++) ans.p[i] = u.p[p[i]];
    return ans;
  }
  void disp() {
    for (int i = 0; i < n; i++) printsp(p[i]);
    puts("");
  }
};
int main() {
  scanf("%s", s);
  n = strlen(s);
  int m;
  cin >> m;
  while (m--) {
    int k, d;
    gn(k, d);
    permutation P, ans, C, D;
    int nn = 0;
    for (int i = 0; i < d; i++) {
      for (int j = i; j < k; j += d) P.p[nn++] = j;
    }
    for (int i = 0; i < n; i++) {
      C.p[P.p[i]] = P.p[(i + 1) % n];
    }
    D = P * C;
    int dd = n - k + 1;
    while (dd) {
      if (dd & 1) ans = ans * D;
      dd >>= 1;
      D = D * D;
    }
    nn = 0;
    for (int i = k - 1; i < n; i++) t[nn++] = (s[ans.p[i]]);
    for (int i = 0; i < k - 1; i++) t[nn++] = (s[ans.p[i]]);
    t[nn] = 0;
    puts(t);
    for (int i = 0; i < n; i++) s[i] = t[i];
  }
  return 0;
}
