Problem:
Score : 800 points

Problem Statement

There is a pond with a rectangular shape.
The pond is divided into a grid with H rows and W columns of squares.
We will denote the square at the i-th row from the top and j-th column from the left by (i,\ j).

Some of the squares in the pond contains a lotus leaf floating on the water.
On one of those leaves, S, there is a frog trying to get to another leaf T.
The state of square (i,\ j) is given to you by a character a_{ij}, as follows:

. : A square without a leaf.

o : A square with a leaf floating on the water.

S : A square with the leaf S.

T : A square with the leaf T.

The frog will repeatedly perform the following action to get to the leaf T: "jump to a leaf that is in the same row or the same column as the leaf where the frog is currently located."

Snuke is trying to remove some of the leaves, other than S and T, so that the frog cannot get to the leaf T.
Determine whether this objective is achievable. If it is achievable, find the minimum necessary number of leaves to remove.

Constraints

2 ≤ H, W ≤ 100

a_{ij} is ., o, S or T.

There is exactly one S among a_{ij}.

There is exactly one T among a_{ij}.

Input

Input is given from Standard Input in the following format:

H W
a_{11} ... a_{1W}
:
a_{H1} ... a_{HW}

Output

If the objective is achievable, print the minimum necessary number of leaves to remove.
Otherwise, print -1 instead.

Sample Input 1

3 3
S.o
.o.
o.T

Sample Output 1

2

Remove the upper-right and lower-left leaves.

Sample Input 2

3 4
S...
.oo.
...T

Sample Output 2

0

Sample Input 3

4 3
.S.
.o.
.o.
.T.

Sample Output 3

-1

Sample Input 4

10 10
.o...o..o.
....o.....
....oo.oo.
..oooo..o.
....oo....
..o..o....
o..o....So
o....T....
....o.....
........oo

Sample Output 4

5

Solution in Go (1.6) (judge verdict: Wrong Answer)

package main

import (
  "bufio"
  "os"
  "strconv"
  "strings"
  "fmt"
)

var reader = bufio.NewReaderSize(os.Stdin, 1000000)
var writer = bufio.NewWriter(os.Stdout)
func NextLine() string {
  buffer := make([]byte, 0)
  for true {
    line, isPrefix, err := reader.ReadLine()
    if err != nil { panic(err) }
    buffer = append(buffer, line...)
    if !isPrefix { break }
  }
  return string(buffer)
}
func NextInt() int {
  n, _ := strconv.Atoi(NextLine())
  return n
}
func NextIntVec() []int {
  L := strings.Split(NextLine(), " ")
  N := make([]int, len(L))
  for i := range N {
    N[i], _ = strconv.Atoi(L[i])
  }
  return N
}
func NextFloat() float64 {
  n, _ := strconv.ParseFloat(NextLine(), 64)
  return n
}
func NextFloatVec() []float64 {
  L := strings.Split(NextLine(), " ")
  N := make([]float64, len(L))
  for i := range N {
    N[i], _ = strconv.ParseFloat(L[i], 64)
  }
  return N
}
func Write(s interface{}) {
  fmt.Fprintln(writer, s)
}
func WriteIntVec(A []int) {
  S := make([]string, len(A))
  for i, a := range A {
    S[i] = strconv.Itoa(a)
  }
  Write(strings.Join(S, " "))
}
func Output() {
  _ = writer.Flush()
}

func MaxInt(A ...int) int {
  max := A[0]
  for _, a := range A {
    if max < a { max = a }
  }
  return max
}
func MinInt(A ...int16) int16 {
  min := A[0]
  for _, a := range A {
    if a < min { min = a }
  }
  return min
}

type Graph struct {
  Capacity [][]int16
  AdjList [][]int16
}

func (G *Graph) FordFulkerson(s, t int) int16 {
  N := len((*G).Capacity)
  P := make([]int, N)
  for {
    for i := range P {
      P[i] = -1
    }
    P[s] = s
    Q := make([]int, 0)
    Q = append(Q, s)
    for 0 < len(Q) {
      q := Q[0]
      Q = Q[1:]
      for _, adj := range (*G).AdjList[q] {
        if 0 <= P[adj] || (*G).Capacity[q][adj] <= 0 { continue }
        P[adj] = q
        Q = append(Q, int(adj))
      }
    }
    if P[t] < 0 { break }
    Dst := t
    Src := P[t]
    C := (*G).Capacity[Src][Dst]
    for Src != s {
      Dst = Src
      Src = P[Src]
      C = MinInt((*G).Capacity[Src][Dst], C)
    }
    Dst = t
    Src = P[t]
    for Dst != s {
      (*G).Capacity[Src][Dst] -= C
      (*G).Capacity[Dst][Src] += C
      Dst = Src
      Src = P[Src]
    }
  }
  F := int16(0)
  for _, Cap := range (*G).Capacity {
    F += Cap[s]
  }
  return F
}

func Solve() {
  HW := NextIntVec()
  H, W := HW[0], HW[1]
  Inf := int16(H * W)
  E := make([][]int16, (H + 1) * (W + 1) - 1)
  for i := range E {
    E[i] = make([]int16, (H + 1) * (W + 1) - 1)
  }
  Adj := make([][]int16, (H + 1) * (W + 1) - 1)
  for i := range Adj {
    Adj[i] = make([]int16, 0)
  }
  s, t := 0, 0
  for i := 0; i < H; i++ {
    A := NextLine()
    for j, a := range A {
      p := i * W + j
      switch a {
      case 'S':
        E[p][H * W + i] = Inf
        E[p][H * W + H + j] = Inf
        s = p
        Adj[p] = append(Adj[p], int16(H * W + i))
        Adj[p] = append(Adj[p], int16(H * W + H + j))
      case 'T':
        E[H * W + i][p] = Inf
        E[H * W + H + j][p] = Inf
        t = p
        Adj[H * W + i] = append(Adj[H * W + i], int16(p))
        Adj[H * W + H + j] = append(Adj[H * W + H + j], int16(p))
      case 'o':
        E[p][H * W + i] = 1
        E[H * W + i][p] = 1
        E[p][H * W + H + j] = 1
        E[H * W + H + j][p] = 1
        Adj[p] = append(Adj[p], int16(H * W + i))
        Adj[p] = append(Adj[p], int16(H * W + H + j))
        Adj[H * W + i] = append(Adj[H * W + i], int16(p))
        Adj[H * W + H + j] = append(Adj[H * W + H + j], int16(p))
      }
    }
  }
  G := Graph{E, Adj}
  ans := G.FordFulkerson(s, t)
  if ans == Inf { ans = -1 }
  Write(ans)
  return
}

func main() {
  Solve()
  Output()
}