1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
#pragma GCC optimize("O3,unroll-loops")

#include <bits/stdc++.h>

using namespace std;

#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x)                                                                    \
    sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<(c i) \
    {
sim > struct rge {
    c b, e;
};
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef XOX
    ~debug()
    {
        cerr << endl;
    }
    eni(!=) cerr << boolalpha << i;
    ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d)
{
    ris << "" << d.first << " --> " << d.second << "";
}
sim dor(rge<c> d)
{
    *this << "[";
    for (auto it = d.b; it != d.e; ++it)
        *this << ", " + 2 * (it == d.b) << *it;
    ris << "]";
}
#else
    sim dor(const c &)
    {
        ris;
    }
#endif
}
;
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

#ifdef XOX
#warning Times may differ!!!
#endif

#define endl '\n'
#define pb emplace_back
#define vt vector
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

const int nax = 1e6, mod = 1e9 + 7;

inline int add(int a, int b)
{
    if ((a += b) >= mod) {
        a -= mod;
    }
    return a;
}

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    int n = 300;
    cin >> n;
    vt<vt<int>> wek(n);
    for (int i = 0; i < n; i++) {
        string s;
        cin >> s;
        for (int j = 0; j < sz(s); j++) {
            wek[i].pb(s[j] == 'L' ? +1 : -1);
        }
    }
#define x first
#define y second
    auto solve_for = [&](vt<int> &one) {
        vt<pair<int, int>> dp(sz(one) + 1);
        for (int i = 0; i < sz(one); i++) {
            int dod = one[i];
            int type = (dod == +1 ? 1 : 0);
            if (type == 1) {
                for (int j = sz(one) - 1; j >= 0; j--) {
                    dp[j + 1].y = add(dp[j].x, dp[j].y);
                }
                dp[1].y = add(dp[1].y, 1);
            }
            else {
                for (int j = 1; j <= sz(one); j++) {
                    dp[j - 1].x = add(dp[j].x, dp[j].y);
                }
            }
        }
        return dp;
    };
    auto solve_for_fixed = [&](vt<pair<int, int>> dp, const vt<int> &one) {
        dp.resize(sz(one) + 1);
        for (int i = 0; i < sz(one); i++) {
            int dod = one[i];
            int type = (dod == +1 ? 1 : 0);
            if (type == 1) {
                for (int j = sz(one) - i - 1; j >= 0; j--) {
                    dp[j + 1].y = add(dp[j].x, dp[j].y);
                }
                dp[1].y = add(dp[1].y, 1);
            }
            else {
                for (int j = 1; j <= sz(one) - i; j++) {
                    dp[j - 1].x = add(dp[j].x, dp[j].y);
                }
            }
        }
        return dp[0].x;
    };
    for (int i = 0; i < n; i++) {
        auto depek = solve_for(wek[i]);
        for (int j = 0; j < n; j++) {
            cout << solve_for_fixed(depek, wek[j]) << " ";
        }
        cout << endl;
    }
}