URI Online Judge | 2871
# Coffee Harvest

**Timelimit: 1**

By Daniel Correia, IFSULDEMINAS Brazil

Jhin owns several farms. Each farm, besides having many livestock creations, also has large coffee plantations. In the midst of profits, expenditures, and crop yields each year, Jhin found it necessary to predict the productivity of each crop in coffee bags based on approximate values of the production of each stand of coffee. Jhin hired a programmer to solve the problem. The programmer proposed that each crop is represented by a matrix in which the coffee grounds are represented by each cell. Each cell (coffee plant) of the matrix (crop) is filled with the values of how many liters (in grains) of coffee the foot will produce in that year.

Assuming that each bag is equivalent to 60 liters of coffee, Jhin needs to know how many sacks and how many liters each crop will produce that year. However, the programmer is a beginner and now needs your help to implement the logic that he developed to solve the problem.

The input is composed of several test cases. The first line contains two integers M (2 <= M <= 99) relative to the number of rows and N (2 <= N <= 99) related to the number of columns the array has. The matrix is composed of integers (0 <= matrix [M] [N] <= 60). The input ends with end of file.

For each incoming test case of your program, print an integer containing the number of bags of coffee concatenated with the string "saca(s) e " concatenated with an integer containing the leftover coffee in liters concatenated with the string " litro(s) ".

Input Sample | Output Sample |

3 3 |
0 saca(s) e 9 litro(s) |