Strange Matrix

All submissions for this problem are available.
Given two matrices A and B. Both have N rows and M columns. In the matrix A, numbers from 1 to MN have been written in row major order. Row major order numbers cells from left to right, and top to bottom. That is,
1 2 3 ... M A = M+1 M+2 M+3 ... 2M 2M+1 2M+2 2M+3 ... 3M . . . ... . . . . ... . (N1)M+1 (N1)M+2 (N1)M+3 ... NM
Similarly, in the matrix B, numbers from 1 to MN have been written in column major order. Column major order numbers cells from top to bottom and left to right.
You are to count number of pairs (i,j) such that A_{i,j}=B_{i,j}.
Input
The input consists of multiple test cases. The first line of input contains a single integer T, the number of test cases. T test cases follow. Each test case is described by one line containing two space separated integers, N and M
Output
Output T lines, i^{th} line containing answer of the i^{th} test case.
Constraints
Example
Input: 1 4 5Output: 2
Explanation
For the first case two matrices look as follows:
A=
1 2 3 4 5
6 7 8 9 10
11 12 13 14 15
16 17 18 19 20
B=
1 5 9 13 17
2 6 10 14 18
3 7 11 15 19
4 8 12 16 20
A_{1,1}=B_{1,1}
A_{4,5}=B_{4,5}
Author:  rubanenko 
Tester:  utkarsh_lath 
Editorial  http://discuss.codechef.com/problems/RRMATRIX 
Tags  Rubanenko, basicmaths, cook38, simple 
Date Added:  4092013 
Time Limit:  1 sec 
Source Limit:  50000 Bytes 
Languages:  C, CPP14, JAVA, PYTH, PYTH 3.6, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, SCALA, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, PERL6, TEXT, CLOJ, FS 
Comments
 Please login at the top to post a comment.
SUCCESSFUL SUBMISSIONS
Fetching successful submissions