t=int(input())
for i in range(t):
z=input()
x=int(z.split()[0])
y=int(z.split()[1])
if y%x==0: print(1,y//x)
else: print(0,0)
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false); cin.tie(0), cout.tie(0);
#define ll long long
#define dv vector<ll>
#define dvp vector<pair<ll,ll>>
#define loop(n) for (ll i = 0; i < n; i++)
#define input(n,v) loop(n) { ll in; cin >> in; v.push_back(in);}
#define inputvp(n,v) loop(n) {ll x,y; cin>>x>>y; v.push_back(make_pair(x,y));}
#define all(v) v.begin(), v.end()
#define sz(s) s.size()
#define chk(v) for (auto& i : v)cout << i <<" "; cout<<"\n"
#define dm map<ll,ll>
#define ds set<ll>
#define fi first
#define se second
using namespace std;
int main()
{
fast;
ll t = 0; cin >> t;
while (t--)
{
ll x = 0, y = 0; cin >> x >> y;
if ((y / x) * x == y)cout << 1 << " " << y / x << "\n";
else cout << "0 0\n";
}
}
869. Reordered Power of 2 | 1593C - Save More Mice |
1217. Minimum Cost to Move Chips to The Same Position | 347. Top K Frequent Elements |
1503. Last Moment Before All Ants Fall Out of a Plank | 430. Flatten a Multilevel Doubly Linked List |
1290. Convert Binary Number in a Linked List to Integer | 1525. Number of Good Ways to Split a String |
72. Edit Distance | 563. Binary Tree Tilt |
1306. Jump Game III | 236. Lowest Common Ancestor of a Binary Tree |
790. Domino and Tromino Tiling | 878. Nth Magical Number |
2099. Find Subsequence of Length K With the Largest Sum | 1608A - Find Array |
416. Partition Equal Subset Sum | 1446. Consecutive Characters |
1618A - Polycarp and Sums of Subsequences | 1618B - Missing Bigram |
938. Range Sum of BST | 147. Insertion Sort List |
310. Minimum Height Trees | 2110. Number of Smooth Descent Periods of a Stock |
2109. Adding Spaces to a String | 2108. Find First Palindromic String in the Array |
394. Decode String | 902. Numbers At Most N Given Digit Set |
221. Maximal Square | 1200. Minimum Absolute Difference |