#include <bits/stdc++.h>
using namespace std;
using P = pair<long long, long long>;
using WeightedGraph = vector<vector<P>>;
using UnWeightedGraph = vector<vector<long long>>;
const long long INF = 1LL << 60;
const long long MOD = 1000000007;
void YN(bool flg) { cout << (flg ? "YES" : "NO") << '\n'; }
void Yn(bool flg) { cout << (flg ? "Yes" : "No") << '\n'; }
void yn(bool flg) { cout << (flg ? "yes" : "no") << '\n'; }
template <typename T>
long long getIndexOfLowerBound(vector<T> &v, T x) {
  return lower_bound(v.begin(), v.end(), x) - v.begin();
}
template <typename T>
long long getIndexOfUpperBound(vector<T> &v, T x) {
  return upper_bound(v.begin(), v.end(), x) - v.begin();
}
template <class T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p_var) {
  is >> p_var.first >> p_var.second;
  return is;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
  for (T &x : vec) is >> x;
  return is;
}
template <typename T>
istream &operator>>(istream &is, vector<vector<T>> &df) {
  for (long long i = 0; i < df.size(); i++)
    for (long long j = 0; j < df[i].size(); j++) is >> df[i][j];
  return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
  cerr << '{';
  os << pair_var.first;
  cerr << ',';
  os << " " << pair_var.second;
  cerr << '}';
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &vec) {
  cerr << '[';
  for (long long i = 0; i < vec.size(); i++)
    os << vec[i] << (i + 1 == vec.size() ? "" : " ");
  cerr << ']';
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, vector<vector<T>> &df) {
  for (auto &vec : df) os << vec;
  return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
  cerr << "{";
  for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
    os << *itr;
    itr++;
    if (itr != map_var.end()) cerr << ", ";
    itr--;
  }
  cerr << "}";
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, set<T> &set_var) {
  cerr << "{";
  for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
    os << *itr;
    itr++;
    if (itr != set_var.end()) cerr << ", ";
    itr--;
  }
  cerr << "}";
  return os;
}
void print() { cout << endl; }
template <class Head, class... Tail>
void print(Head &&head, Tail &&...tail) {
  cout << head;
  if (sizeof...(tail) != 0) cout << " ";
  print(forward<Tail>(tail)...);
}
void dump_func() { cerr << '#' << endl; }
template <typename Head, typename... Tail>
void dump_func(Head &&head, Tail &&...tail) {
  cerr << head;
  if (sizeof...(Tail) > 0) cerr << ", ";
  dump_func(std::move(tail)...);
}
signed main(void) {
  cin.tie(0);
  ios::sync_with_stdio(false);
  string s;
  cin >> s;
  list<char> li;
  for (long long(i) = 0; (i) < (s.size()); (i)++) {
    li.push_back(s[i]);
  }
  long long m;
  cin >> m;
  for (long long(i) = 0; (i) < (m); (i)++) {
    long long l, r, k;
    cin >> l >> r >> k;
    l--;
    r--;
    long long base = r - l + 1;
    k %= base;
    deque<char> deq;
    for (long long j = l; j <= r; j++) {
      deq.push_back(s[j]);
    }
    while (k--) {
      char tmp = deq.back();
      deq.pop_back();
      deq.push_front(tmp);
    }
    for (long long j = l; j <= r; j++) {
      s[j] = deq.front();
      deq.pop_front();
    };
  }
  print(s);
}
