#include<iostream>
#include<cmath>
#include<set>
using namespace std ;
int main()
{
int t ;
cin >> t ;
while (t--)
{
int a, b, l ;
cin >> a >> b >> l ;
set<int> ans ;
for( int x = 0 ; x < 20 ; x++)
{
for( int y = 0 ; y < 20 ; y++)
{
if(l % (int)(pow(a,x) * pow(b,y)) == 0 )
ans.insert(l / (int)(pow(a,x) * pow(b,y))) ;
}
}
cout << ans.size() << endl ;
}
}
20. Valid Parentheses | 746. Min Cost Climbing Stairs |
392. Is Subsequence | 70. Climbing Stairs |
53. Maximum Subarray | 1527A. And Then There Were K |
1689. Partitioning Into Minimum Number Of Deci-Binary Numbers | 318. Maximum Product of Word Lengths |
448. Find All Numbers Disappeared in an Array | 1155. Number of Dice Rolls With Target Sum |
415. Add Strings | 22. Generate Parentheses |
13. Roman to Integer | 2. Add Two Numbers |
515. Find Largest Value in Each Tree Row | 345. Reverse Vowels of a String |
628. Maximum Product of Three Numbers | 1526A - Mean Inequality |
1526B - I Hate 1111 | 1881. Maximum Value after Insertion |
237. Delete Node in a Linked List | 27. Remove Element |
39. Combination Sum | 378. Kth Smallest Element in a Sorted Matrix |
162. Find Peak Element | 1529A - Eshag Loves Big Arrays |
19. Remove Nth Node From End of List | 925. Long Pressed Name |
1051. Height Checker | 695. Max Area of Island |