#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <time.h>
#include <random>
#include <string>
#include <cassert>
#include <vector>
#include <ostream>
#include <istream>

using namespace std;

#define int long long
#define pb push_back
#define all(a) (a).begin(), (a).end()

#define LOCAL

#ifdef LOCAL
    #define dbg(x) cout << #x << " : " << (x) << "\n";
#else
    #define dbg(x)
#endif

ostream& operator << (ostream &a, const vector<int> &b) {
    for (auto k : b) cout << k << " ";
    cout << "\n";
    return a;
}

const int mod = 1e9 + 7;
const int p = 10;
const int MAXL = 101;

int pw[MAXL];

inline int subh(const vector<int> &h, const int &l, const int &r) {
    int big = h[r], small = 0;
    if (l != 0) {
        small = h[l - 1];
    }
    return (big - ((small * pw[r - l + 1]) % mod) + mod) % mod;
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    pw[0] = 1;
    for (int i = 1; i < MAXL; i++) {
        pw[i] = (pw[i - 1] * p) % mod;
    }
    string s;
    cin >> s;
    int n = s.size();
    vector<int> h(n);
    h[0] = s[0] - 'a' + 1;
    for (int i = 1; i < n; i++) {
        h[i] = (h[i - 1] * p + (s[i] - 'a' + 1)) % mod;
    }
    cout << subh(h, 0, 2) << "\n" << subh(h, 1, 2) << "\n" << subh(h, 2, 2);
}