#include<bits/stdc++.h>
#define maxn 5010
#define mod 1000000007
using namespace std;
int dp1[maxn][maxn],n,dp2[maxn][maxn],jie[maxn],j3[maxn],j2[maxn];
char s[maxn];
int main(){
	freopen("pathh.in","r",stdin);
	freopen("pathh.out","w",stdout);
	scanf("%s",s);n=strlen(s);
	dp1[n+1][0]=1;
	for(int i=n+1;i>=2;i--){
		for(int j=0;j<=n+1-i;j++){
			if(s[i-2]=='<'){
				dp1[i-1][j+1]=(dp1[i-1][j+1]+dp1[i][j])%mod;
				dp1[i-1][j]=(dp1[i-1][j]+1ll*dp1[i][j]*j)%mod;
			}
			else{
				if(j)dp1[i-1][j-1]=(dp1[i-1][j-1]+1ll*dp1[i][j]*(j-1)*j)%mod;
				dp1[i-1][j]=(dp1[i-1][j]+1ll*dp1[i][j]*j)%mod;
			}
		}
	}
	dp2[0][0]=1;
	for(int i=0;i<=n-1;i++){
		for(int j=0;j<=i;j++){
			if(s[i]=='>'){
				dp2[i+1][j+1]=(dp2[i+1][j+1]+dp2[i][j])%mod;
				dp2[i+1][j]=(dp2[i+1][j]+1ll*dp2[i][j]*j)%mod;
			}
			else{
				if(j>1)dp2[i+1][j-1]=(dp2[i+1][j-1]+1ll*dp2[i][j]*(j-1)*j)%mod;
				dp2[i+1][j]=(dp2[i+1][j]+1ll*dp2[i][j]*j)%mod;
			}
		}
	}
	jie[0]=1;
	for(int i=1;i<=n;i++)jie[i]=1ll*jie[i-1]*i%mod;
	for(int i=1;i<=n;i++)j3[i]=1ll*jie[i]*jie[i]%mod,j2[i]=1ll*jie[i]*jie[i-1]%mod;
	for(int i=1;i<=n;i++){
		int sum=0;
		for(int j=1;j<=n;j++)
			sum=(sum+(2ll*dp1[i+1][j]*dp2[i-1][j]%mod)*j3[j]+((1ll*dp1[i+1][j]*dp2[i-1][j-1]+1ll*dp2[i-1][j]*dp1[i+1][j-1])%mod)*j2[j])%mod;
		cout<<sum<<' ';
	}
	cout<<endl;
	return 0;          
}