#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int n, a[1000001], k, ans;
char str[1000001];
namespace has {
const int mod = 998244353, b = 31;
int pw[1000001], s[1000001];
inline void build() {
    pw[0] = 1;

    for (int i = 1; i <= n; i++) {
        pw[i] = 1ll * pw[i - 1] * b % mod;
        s[i] = (s[i - 1] + 1ll * pw[i - 1] * a[i]) % mod;
    }
}
inline int query(int l, int r) {
    return s[r] < s[l - 1] ? s[r] + mod - s[l - 1] : s[r] - s[l - 1];
}
inline int lcs(int i, int j, int up = 1 << 30) {
    if (a[i] != a[j])
        return 0;

    if (i > j)
        swap(i, j);

    if (!i)
        return 0;

    if (1ll * query(1, i) * pw[j - i] % mod == query(j - i + 1, j))
        return i;

    int l = 2, r = min(i, up), ans = 1;

    if (1ll * query(i - r + 1, i) * pw[j - i] % mod == query(j - r + 1, j))
        return r;

    while (l <= r) {
        int mid = (l + r) >> 1;

        if (1ll * pw[j - i] * query(i - mid + 1, i) % mod ==
                1ll * query(j - mid + 1, j))
            ans = mid, l = mid + 1;
        else
            r = mid - 1;
    }

    return ans;
}
inline int lcp(int i, int j, int up = 1 << 30) {
    if (a[i] != a[j])
        return 0;

    if (i > j)
        swap(i, j);

    if (j > n)
        return 0;

    int l = 2, r = min(up, n - j + 1), ans = 1;

    if (1ll * query(i, i + r - 1) * pw[j - i] % mod == query(j, j + r - 1))
        return r;

    while (l <= r) {
        int mid = (l + r) >> 1;

        if (1ll * pw[j - i] * query(i, i + mid - 1) % mod == query(j, j + mid - 1))
            ans = mid, l = mid + 1;
        else
            r = mid - 1;
    }

    return ans;
}
} // namespace has
using has::lcp;
using has::lcs;
struct runs {
    int l, r, p;
    bool operator<(const runs &j) const {
        return l != j.l ? l < j.l : r < j.r;
    }
    bool operator==(const runs &j) {
        return l == j.l && r == j.r && p == j.p;
    }
} q[2000001];
inline void get_runs(int &k) {
    static int st[1000001];
    st[0] = n + 1;

    for (int i = n, top = 0, lt = 0; i; i--) {
        while (top) {
            int x = min(st[top] - i, st[top - 1] - st[top]);
            lt = lcp(i, st[top], x);

            if ((lt == x && st[top] - i < st[top - 1] - st[top]) ||
                    (lt < x && a[i + lt] < a[st[top] + lt]))
                top--, lt = 0;
            else
                break;
        }

        int j = st[top];
        st[++top] = i;
        int x = lcs(i - 1, j - 1, j - i), y;

        if (x < j - i) {
            y = lt + lcp(i + lt, j + lt, n);

            if (x + y >= j - i) {
                k++;
                q[k] = runs{i - x, j + y - 1, j - i};
            }
        }
    }
}
int main() {
    scanf("%s", str + 1), n = strlen(str + 1);

    for (int i = 1; i <= n; i++)
        a[i] = 25 - (str[i] - 'a');

    has::build(), get_runs(k);

    for (int i = 1; i <= n; i++)
        a[i] = 25 - a[i];

    has::build(), get_runs(k);
    sort(q + 1, q + k + 1), k = unique(q + 1, q + k + 1) - q - 1;
    cout << k << endl;

    for (int i = 1; i <= k; i++)
        printf("%d %d %d\n", q[i].l, q[i].r, q[i].p);
}