School Dance

There are n boys and m girls in a school. Next week a school dance will be organized. A dance pair consists of a boy and a girl, and there are k potential pairs. Your task is to find out the maximum number of dance pairs and show how this number can be achieved. Input The first input line has three integers n, m and k: the number of boys, girls, and potential pairs. The boys are numbered 1,2,\d