### Problem Statement

In soccer, all the major national leagues are conducted in the following way:

A league consists of several teams. Over the course of a year, each team must play exactly two matches against each of the other teams - one at its own stadium and one at the opponent's stadium. When a team plays at its own stadium, it is called the "home team" and its opponent is called the "away team". Each match ends in one of three possible results: a home team victory, a draw, or an away team victory. Each time a team wins, it is awarded 3 points. When there's a draw, both teams are awarded 1 point. No points are awarded for a loss. The overall ranking of the teams is based on the total number of points received by each team.

You are given a String[] matches. The j-th character of the i-th element of matches denotes the result of the match between team i and team j at team i's stadium. 'W' represents a home team victory, 'D' represents a draw, and 'L' represents an away team victory. All characters on the main diagonal of matches will be '-' because a team never plays against itself. Return a int[] where the i-th element is the total number of points received by the i-th team.

### Definition

 Class: SoccerLeagues Method: points Parameters: String[] Returns: int[] Method signature: int[] points(String[] matches) (be sure your method is public)

### Constraints

-matches will contain exactly n elements, where n is between 2 and 50, inclusive.
-Each element of matches will contain exactly n characters.
-matches will contain only '-','W','D' and 'L' characters.
-For all i, the i-th character of the i-th element of matches will be '-', and no other characters will be '-'.

### Examples

0)

 ```{"-WW", "W-W", "WW-"}```
`Returns: {6, 6, 6 }`
 There are 3 teams in the league, and in all matches the home team has won.
1)

 ```{"-DD", "L-L", "WD-"}```
`Returns: {5, 2, 8 }`
 This time, the first team has 1 win and 2 draws, the second one has 2 draws and the third has 2 wins and 2 draws.
2)

 ```{"-DWWD", "L-WLL", "DD-WD", "DDL-L", "DDLL-"}```
`Returns: {14, 7, 12, 8, 10 }`
3)

 ```{"-LWWLWDLDWWWWWWDDWDW", "D-WWLDDWDWDLWDDWLWDD", "LL-DLDWDLDLDWWWLWDDW", "LDD-LLLDLWLWWWWDWDWL", "LWWW-DWDLWDWDWWWDWDW", "DLLWD-WWLLDDDLWWDWWW", "WWLWDL-LLDWWWWWDWWLW", "LLLLLDW-LDLWDDLLLDWL", "DWWWWDDD-DWWWWDWWWDW", "WWWWLLLWL-LWWWWWLWWW", "DWWWWWWWLW-WDWWWWWWW", "DDDLLLDWWWL-DDWDWLDD", "LWLWLDLLLDLW-DDDWWDD", "LLWWLWDDLWLWL-WWWDLL", "WWWWLLDDDWLWDD-WWWLW", "DLDLLLWWLLLWWLW-DWLL", "DLWWWLDLWWDWWDWL-WWD", "LLDDLLWLLWLWLDLWW-WW", "LLWLLLWWLWLWWDWWLD-W", "LLWDLWDWDWLLWWDDWWL-"}```
```Returns:
{72, 62, 41, 41, 83, 63, 53, 35, 86, 50, 90, 32, 34, 41, 45, 36, 51, 32, 51, 45 }```
 This is the actual table for the latest season's Barclaycard Premiership with the teams sorted alphabetically.

#### Problem url:

http://www.topcoder.com/stat?c=problem_statement&pm=10505

#### Problem stats url:

http://www.topcoder.com/tc?module=ProblemDetail&rd=13751&pm=10505

gojira_tc

#### Testers:

PabloGilberto , Yarin , ivan_metelsky

#### Problem categories:

Simple Search, Iteration