#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse4")
using namespace std;
constexpr long long mod = 1000000009;
const long long INF = mod * mod;
const double eps = 1e-12;
const double pi = acosl(-1.0);
long long mod_pow(long long x, long long n, long long m = mod) {
  long long res = 1;
  while (n) {
    if (n & 1) res = res * x % m;
    x = x * x % m;
    n >>= 1;
  }
  return res;
}
struct modint {
  long long n;
  modint() : n(0) { ; }
  modint(long long m) : n(m) {
    if (n >= mod)
      n %= mod;
    else if (n < 0)
      n = (n % mod + mod) % mod;
  }
  operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) {
  a.n += b.n;
  if (a.n >= mod) a.n -= mod;
  return a;
}
modint operator-=(modint& a, modint b) {
  a.n -= b.n;
  if (a.n < 0) a.n += mod;
  return a;
}
modint operator*=(modint& a, modint b) {
  a.n = ((long long)a.n * b.n) % mod;
  return a;
}
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, long long n) {
  if (n == 0) return modint(1);
  modint res = (a * a) ^ (n / 2);
  if (n % 2) res = res * a;
  return res;
}
long long inv(long long a, long long p) {
  return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 10;
modint fact[max_n], factinv[max_n];
void init_f() {
  fact[0] = modint(1);
  for (int i = 0; i < max_n - 1; i++) {
    fact[i + 1] = fact[i] * modint(i + 1);
  }
  factinv[max_n - 1] = modint(1) / fact[max_n - 1];
  for (int i = max_n - 2; i >= 0; i--) {
    factinv[i] = factinv[i + 1] * modint(i + 1);
  }
}
modint comb(int a, int b) {
  if (a < 0 || b < 0 || a < b) return 0;
  return fact[a] * factinv[b] * factinv[a - b];
}
void solve() {
  string s;
  cin >> s;
  string cop;
  int n, m;
  n = s.size();
  cin >> m;
  for (int i = 0; i < m; i++) {
    int k, d;
    cin >> k >> d;
    vector<int> nex(k);
    int tmp = 0;
    for (int j = 0; j < d; j++) {
      for (int loc = j; loc < k; loc += d) {
        nex[loc] = tmp;
        tmp++;
      }
    }
    for (int j = 0; j < k; j++) nex[j]--;
    vector<vector<int>> nnex(k, vector<int>(20));
    for (int j = 0; j < k; j++) nnex[j][0] = nex[j];
    for (int t = 0; t < 19; t++) {
      for (int j = 0; j < k; j++) {
        if (nnex[j][t] < 0)
          nnex[j][t + 1] = -1;
        else
          nnex[j][t + 1] = nnex[nnex[j][t]][t];
      }
    }
    auto query = [&](int le, int c, int r) -> int {
      int sum = 0;
      bool up = false;
      for (int t = 20 - 1; t >= 0; t--) {
        if (sum + (1 << t) > r) continue;
        if (nnex[c][t] < 0) {
          up = true;
          continue;
        }
        c = nnex[c][t];
        sum += 1 << t;
      }
      if (up) {
        return le + sum;
      } else {
        return n - k + 1 + c;
      }
    };
    cop = s;
    for (int j = 0; j < n; j++) {
      int le, c, r;
      if (j < k) {
        le = 0, c = j, r = n - k + 1;
      } else {
        le = j - k + 1, c = k - 1, r = n - j;
      }
      cop[query(le, c, r)] = s[j];
    }
    swap(s, cop);
    cout << s << "\n";
  }
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  solve();
  return 0;
}
