You are given a grid with $R$ rows (numbered $1$ through $R$) and $C$ columns (numbered $1$ through $C$). Initially, each cell of this grid is either empty, contains an ant or an anteater. Each ant is moving in a fixed direction: up, down, left or right. The anteaters do not move.
The movement of ants happens in discrete steps. For example, when an ant is in the cell in the $i$-th row and $j$-th column at some point in time (in some step) and it is moving down, then in the next step, it enters the cell in the $(i+1)$-th row and $j$-th column. Two ants meet each other when they enter the same cell at the same point in time (in the same step). When ants meet, they do not interact in any way and keep moving in their fixed directions.
If an ant reaches an anteater, that anteater eats the ant, so the ant completely disappears. If an ant attempts to leave the grid, it also disappears. When two ants enter a cell containing an anteater at the same time, they are eaten before they could meet.
Calculate the total number of pairs of ants that meet each other.

-----Input-----
- The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows.
- The first line of each test case contains two space-separated integers $R$ and $C$.
- Each of the following $R$ lines contains a single string with length $C$. For each valid $i, j$, the $j$-th character in the $i$-th string is:
- '#' if the cell in the $i$-th row and $j$-th column of the grid contains an anteater
- 'U', 'D', 'L' or 'R' if this cell contains an ant moving up, down, left or right respectively
- '-' if this cell is empty

-----Output-----
For each test case, print a single line containing one integer — the number of pairs of ants that meet.

-----Constraints-----
- $1 \le T \le 10$
- $1 \le R, C \le 50$
- each string contains only characters 'U', 'D', 'L', 'R', '#' and '-'

-----Example Input-----
10
3 3
R--
---
--U
1 4
R--R
2 2
--
--
1 4
R--L
1 4
-R-L
1 4
-R#L
3 3
R-D
-#-
R-U
3 3
R-D
---
R#U
3 3
-D-
R-L
-U-
1 7
RLLLLLL

-----Example Output-----
1
0
0
0
1
0
3
2
6
3

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = " \nimport math as mt \ndef countPairs(arr, n): \n\n\tmp = dict() \n\tfor i in range(n): \n\t\tif arr[i] in mp.keys(): \n\t\t\tmp[arr[i]] += 1\n\t\telse: \n\t\t\tmp[arr[i]] = 1\n\tans = 0\n\tfor it in mp: \n\t\tcount = mp[it] \n\t\tans += (count * (count - 1)) // 2\n\treturn ans \n\n# cook your dish here\nfor _ in range(int(input())):\n    (r,c)= map(int,input().split())\n    has = []\n    simple = []\n    for i in range(r):\n        lis = input()\n        lis = list(lis)\n        for j in range(c):\n            if(lis[j]=='#'):\n                has.append([i,j])\n            elif(lis[j]!='-'):\n                simple.append([lis[j],[i,j]])\n    sum1=0\n    for j in range(max(r,c)):\n        he ,del1= [],[]\n        flag = 0\n        for i in simple:\n            if(i[0]=='R' and i[1][1]+j+1<=c):\n                if(has.count([i[1][0],i[1][1]+j+1])==0):\n                    he.append((i[1][0],i[1][1]+j+1))\n                else:\n                    del1.append(i)\n            elif(i[0]=='D' and i[1][0]+j+1<=r):\n                if(has.count([i[1][0]+j+1,i[1][1]])==0):\n                    he.append((i[1][0]+j+1,i[1][1]))\n                else:\n                    del1.append(i)\n                    \n            elif(i[0]=='L' and i[1][1]-j-1>=0):\n                if(has.count([i[1][0],i[1][1]-j-1])==0):\n                    he.append((i[1][0],i[1][1]-j-1))\n                else:\n                    del1.append(i)\n                    \n            elif(i[0]=='U' and (i[1][0]-j-1)>=0):\n                if(has.count([i[1][0]-j-1,i[1][1]])==0):\n                    he.append((i[1][0]-j-1,i[1][1]))\n                else:\n                   del1.append(i)\n        sum1+=countPairs(he,len(he))\n        for p in del1:\n            simple.remove(p)\n    print(sum1)"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 14891