放苹果

package com.oj5;

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Oj {
	static int count;
	private static void find(int[] flag,int pos,int appleNum,int plateNum,List list){
		//System.out.println(appleNum+" "+plateNum+" "+pos);
		if(pos==appleNum){
			int[] plates = new int[plateNum+1];
			for(int i = 0;i < appleNum; i++)
				plates[flag[i]]++;
			for(int i = 1; i<= plateNum-1; i++)
				for(int j = 1;j <= plateNum-i; j++)
					if(plates[j]<plates[j+1]){
						int temp = plates[j];
						plates[j] = plates[j+1];
						plates[j+1] = temp;
					}
			boolean isExist = false; 
			for(int i = 0;i < list.size(); i++){
				int[] arr = (int[]) list.get(i);
				int j = 1;
				for(;j <= plateNum; j++)
					if(plates[j]!=arr[j])
						break;
				if(j==plateNum+1){
					isExist = true;
					break;
				}
			}
			if(!isExist)
				list.add(plates);
			return;
		}
		
		for(int i = 1;i <= plateNum; i++){
			flag[pos] = i;
			find(flag,pos+1,appleNum,plateNum,list);
		}
	}
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int appleNum = in.nextInt();
		int plateNum = in.nextInt();
		int[] flag = new int[appleNum];
		List<Integer[]> list = new ArrayList<Integer[]>();
		find(flag,0,appleNum,plateNum,list);
		System.out.println(list.size());
	}
}