import java.util.Arrays;
import java.util.LinkedList;
import java.util.Scanner;

public class Main2 {
	
	public static long diff_count(int div, int x, long a){
		final int act_x = x - div;
		long ret_a = a;
		
		
		for(int i = x; i > act_x; i--){ ret_a *= i; }
		return ret_a;
	}
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		final int N = sc.nextInt();
		final int D = sc.nextInt();
		final char[] chs = sc.next().toCharArray();
		
		long[] answer = new long[D + 1]; 
		
		int div_level = 0;
		int x_count = 0;
		long a_count = 0;
		for(int i = 0; i < N; i++){
			
			if(chs[i] == '{'){
				div_level++;
			}else if(chs[i] == '}'){
				
				final int act_x_count = x_count - div_level;
				if(act_x_count >= 0){
					answer[act_x_count] += diff_count(div_level, x_count, a_count);
				}
				
				x_count = 0; a_count = 0;
				div_level--;
				
			}else if(chs[i] == '+'){
				
				final int act_x_count = x_count - div_level;
				if(act_x_count >= 0){
					answer[act_x_count] += diff_count(div_level, x_count, a_count);
				}
				
				x_count = 0; a_count = 0;
				
			}else if('1' <= chs[i] && chs[i] <= '9'){
				if(a_count == 0){ a_count = 1; }
				a_count *= (chs[i] - '0');
			}else if(chs[i] == 'x'){
				x_count += 1;
				if(a_count == 0){ a_count = 1; }
			}
		}
		
		final int act_x_count = x_count - div_level;
		if(act_x_count >= 0){
			answer[act_x_count] += diff_count(div_level, x_count, a_count);
		}
		
		
		for(int i = 0; i <= D; i++){
			System.out.print((i == 0 ? "" : " ") + answer[i]);
		}
		System.out.println();
	}
}