#include using namespace std; using ll=long long; using intpair=pair; using llpair=pair; using llvec=vector; using llmat=vector>; #define PI 3.141592653589793 #define llmattp(name,a,b,num) name(a,vector(b,num)) #define INTINF 1<<30 #define LLINF 1LL<<60 #define ABS(x) ( (x)>0 ? (x) : -(x) ) #define gsort(vbeg,vend) sort(vbeg,vend,greater<>()) template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } ll gcd(ll a, ll b) { //最大公約数 if(a==0||b==0) return 0; if(a n) { return 0; } if (r > n / 2) { r = n - r; } if (n == 0) { return 0; } if (r == 0) { return 1; } if (r == 1) { return n; } double result = 1; for (double i = 1; i <= r; i++) { result *= (n - i + 1) / i; } return (ll)result; } ll GreaterBinarySearch(ll *array, ll key, ll max, ll min) { //にぶたんgreater if(array[max]key) { return GreaterBinarySearch(array,key,mid+1,min); } else { return mid; } } } int DigitNum(ll n) { //桁数 int digit=0; ll wari=1LL; while(n/wari) { digit++; wari*=10; } return digit; } bool IsPrime(ll num) { //素数判定 if (num < 2) return false; else if (num == 2) return true; else if (num % 2 == 0) return false; // 偶数はあらかじめ除く double sqrtNum = sqrt(num); for (ll i = 3; i <= sqrtNum; i += 2) { if (num % i == 0) { // 素数ではない return false; } } // 素数である return true; } vector Divisor(ll x) { // 約数列挙 vector result; ll i=1LL; for( ; i*i PrimeFact(ll x) { // 素因数分解 {素因数,指数} vector result; ll ex=0LL; if(x%2==0) { while(x%2==0) { x/=2; ex++; } result.push_back({2,ex}); } for(ll i=3LL; i*i<=x; i+=2) { if(x%i) continue; ex=0LL; while(x%i==0) { x/=i; ex++; } result.push_back({i,ex}); } if(x!=1) result.push_back({x,1}); return result; } bool Palind(string s) { //回文判定 return s == string(s.rbegin(), s.rend()); } int main() { ll A,B; cin>>A>>B; if(A==0) { cout<=0) { cout<